Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
In this paper, we consider a parallel machine problem where machines and jobs can be classified into two levels: high and low levels. A high-level machine can process all jobs while a low-level machine can process only low-level jobs. The objective of the problem is to minimize the makespan. This pr...
Gespeichert in:
| Veröffentlicht in: | The open operational research journal 2008-03, Vol.2 (1), p.18-24 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 24 |
|---|---|
| container_issue | 1 |
| container_start_page | 18 |
| container_title | The open operational research journal |
| container_volume | 2 |
| creator | Lin, Chien-Hung Liao, Ching-Jong |
| description | In this paper, we consider a parallel machine problem where machines and jobs can be classified into two levels: high and low levels. A high-level machine can process all jobs while a low-level machine can process only low-level jobs. The objective of the problem is to minimize the makespan. This problem is a special case of the parallel machine problem with machine eligibility restrictions. The problem is NP-hard and a heuristic algorithm has recently been proposed. However, there are no algorithms in the literature that can solve the problem to optimality. In this paper, we develop such an exact algorithm by utilizing some useful properties inherent in the problem. Computational experiments show that the developed algorithm can find the optimal solution for various-sized problems in a short time. |
| doi_str_mv | 10.2174/1874243200802010018 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_963852894</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>963852894</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1718-b89f7ff5c49a4073cf58e6e316e758b1579b5e026c41c1a41aa1a2228abdbba93</originalsourceid><addsrcrecordid>eNptkE9LAzEUxIMoWKufwMvePK3m326So5RqhVZF9Ly8xGz7NM3WZIvUT29LFTx4evN-DMMwhJwzesmZkldMK8ml4JRqyimjlOkDMtjRcocP_-hjcpLzG6U1N0YPyP0MIy7xC-O8mMG7zyuIRReLR0gQgg9b6BYYfS4-sV_8fsU44BwtBuw3xZPPfULXYxfzKTlqIWR_9nOH5OVm_DyalNOH27vR9bR0TDFdWm1a1baVkwYkVcK1lfa1F6z2qtKWVcrYylNeO8kcA8kAGHDONdhXa8GIIbnY565S97HeFmiWmJ0PAaLv1rkxtdAV10ZunWLvdKnLOfm2WSVcQto0jDa78Zp_xhPfKPth9g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>963852894</pqid></control><display><type>article</type><title>Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Lin, Chien-Hung ; Liao, Ching-Jong</creator><creatorcontrib>Lin, Chien-Hung ; Liao, Ching-Jong</creatorcontrib><description>In this paper, we consider a parallel machine problem where machines and jobs can be classified into two levels: high and low levels. A high-level machine can process all jobs while a low-level machine can process only low-level jobs. The objective of the problem is to minimize the makespan. This problem is a special case of the parallel machine problem with machine eligibility restrictions. The problem is NP-hard and a heuristic algorithm has recently been proposed. However, there are no algorithms in the literature that can solve the problem to optimality. In this paper, we develop such an exact algorithm by utilizing some useful properties inherent in the problem. Computational experiments show that the developed algorithm can find the optimal solution for various-sized problems in a short time.</description><identifier>ISSN: 1874-2432</identifier><identifier>EISSN: 1874-2432</identifier><identifier>DOI: 10.2174/1874243200802010018</identifier><language>eng</language><subject>Algorithms ; Computation ; Constrictions ; Heuristic methods ; Low level ; Mathematical models ; Operational research ; Optimization</subject><ispartof>The open operational research journal, 2008-03, Vol.2 (1), p.18-24</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1718-b89f7ff5c49a4073cf58e6e316e758b1579b5e026c41c1a41aa1a2228abdbba93</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Lin, Chien-Hung</creatorcontrib><creatorcontrib>Liao, Ching-Jong</creatorcontrib><title>Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions</title><title>The open operational research journal</title><description>In this paper, we consider a parallel machine problem where machines and jobs can be classified into two levels: high and low levels. A high-level machine can process all jobs while a low-level machine can process only low-level jobs. The objective of the problem is to minimize the makespan. This problem is a special case of the parallel machine problem with machine eligibility restrictions. The problem is NP-hard and a heuristic algorithm has recently been proposed. However, there are no algorithms in the literature that can solve the problem to optimality. In this paper, we develop such an exact algorithm by utilizing some useful properties inherent in the problem. Computational experiments show that the developed algorithm can find the optimal solution for various-sized problems in a short time.</description><subject>Algorithms</subject><subject>Computation</subject><subject>Constrictions</subject><subject>Heuristic methods</subject><subject>Low level</subject><subject>Mathematical models</subject><subject>Operational research</subject><subject>Optimization</subject><issn>1874-2432</issn><issn>1874-2432</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNptkE9LAzEUxIMoWKufwMvePK3m326So5RqhVZF9Ly8xGz7NM3WZIvUT29LFTx4evN-DMMwhJwzesmZkldMK8ml4JRqyimjlOkDMtjRcocP_-hjcpLzG6U1N0YPyP0MIy7xC-O8mMG7zyuIRReLR0gQgg9b6BYYfS4-sV_8fsU44BwtBuw3xZPPfULXYxfzKTlqIWR_9nOH5OVm_DyalNOH27vR9bR0TDFdWm1a1baVkwYkVcK1lfa1F6z2qtKWVcrYylNeO8kcA8kAGHDONdhXa8GIIbnY565S97HeFmiWmJ0PAaLv1rkxtdAV10ZunWLvdKnLOfm2WSVcQto0jDa78Zp_xhPfKPth9g</recordid><startdate>20080317</startdate><enddate>20080317</enddate><creator>Lin, Chien-Hung</creator><creator>Liao, Ching-Jong</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TA</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JG9</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080317</creationdate><title>Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions</title><author>Lin, Chien-Hung ; Liao, Ching-Jong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1718-b89f7ff5c49a4073cf58e6e316e758b1579b5e026c41c1a41aa1a2228abdbba93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithms</topic><topic>Computation</topic><topic>Constrictions</topic><topic>Heuristic methods</topic><topic>Low level</topic><topic>Mathematical models</topic><topic>Operational research</topic><topic>Optimization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lin, Chien-Hung</creatorcontrib><creatorcontrib>Liao, Ching-Jong</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>The open operational research journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lin, Chien-Hung</au><au>Liao, Ching-Jong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions</atitle><jtitle>The open operational research journal</jtitle><date>2008-03-17</date><risdate>2008</risdate><volume>2</volume><issue>1</issue><spage>18</spage><epage>24</epage><pages>18-24</pages><issn>1874-2432</issn><eissn>1874-2432</eissn><abstract>In this paper, we consider a parallel machine problem where machines and jobs can be classified into two levels: high and low levels. A high-level machine can process all jobs while a low-level machine can process only low-level jobs. The objective of the problem is to minimize the makespan. This problem is a special case of the parallel machine problem with machine eligibility restrictions. The problem is NP-hard and a heuristic algorithm has recently been proposed. However, there are no algorithms in the literature that can solve the problem to optimality. In this paper, we develop such an exact algorithm by utilizing some useful properties inherent in the problem. Computational experiments show that the developed algorithm can find the optimal solution for various-sized problems in a short time.</abstract><doi>10.2174/1874243200802010018</doi><tpages>7</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1874-2432 |
| ispartof | The open operational research journal, 2008-03, Vol.2 (1), p.18-24 |
| issn | 1874-2432 1874-2432 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_963852894 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Algorithms Computation Constrictions Heuristic methods Low level Mathematical models Operational research Optimization |
| title | Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T13%3A09%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Minimizing%20Makespan%20on%20Parallel%20Machines%20with%20Machine%20Eligibility%20Restrictions&rft.jtitle=The%20open%20operational%20research%20journal&rft.au=Lin,%20Chien-Hung&rft.date=2008-03-17&rft.volume=2&rft.issue=1&rft.spage=18&rft.epage=24&rft.pages=18-24&rft.issn=1874-2432&rft.eissn=1874-2432&rft_id=info:doi/10.2174/1874243200802010018&rft_dat=%3Cproquest_cross%3E963852894%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=963852894&rft_id=info:pmid/&rfr_iscdi=true |