Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness
This paper presents optimal scheduling in a two-machine flow shop, in which the objective function is to minimize the sum of maximum earliness and tardiness ( n/2/ P/ ET max ). Since this problem tries to minimize earliness and tardiness, the results can be useful for different production systems su...
Gespeichert in:
| Veröffentlicht in: | International journal of production economics 2009-12, Vol.122 (2), p.763-773 |
|---|---|
| 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 | 773 |
|---|---|
| container_issue | 2 |
| container_start_page | 763 |
| container_title | International journal of production economics |
| container_volume | 122 |
| creator | Moslehi, G. Mirzaee, M. Vasei, M. Modarres, M. Azaron, A. |
| description | This paper presents optimal scheduling in a two-machine flow shop, in which the objective function is to minimize the sum of maximum earliness and tardiness (
n/2/
P/
ET
max
). Since this problem tries to minimize earliness and tardiness, the results can be useful for different production systems such as just in time (JIT). This objective function has already been considered for
n jobs and
m machines, but the proposed algorithms are not efficient to solve large scale problems. In this paper, neighborhood conditions are developed and the dominant set for any optimal solution is determined. The branch-and-bound (B&B) method is used to solve the problem and the proper upper and lower bounds are also introduced. A number of effective lemmas are introduced to develop an algorithm which is more efficient than those already known. To show the effectiveness of the proposed algorithm, 380 problems of different sizes are randomly generated and solved. More than 82% of the problems are shown to reach optimal solutions. |
| doi_str_mv | 10.1016/j.ijpe.2009.07.003 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_907944043</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0925527309002424</els_id><sourcerecordid>907944043</sourcerecordid><originalsourceid>FETCH-LOGICAL-c489t-4ef4084436802c604bad7253eee3c2431cf56eb62774d43afd9e5780d389be6b3</originalsourceid><addsrcrecordid>eNp9kM1u1TAQhS0EEpfCC7Cy2LBKGP8ktiU2qKKAqMSmiKXl60yIoyQOdtJSnh7fXsSCBYuxx9I5Z8YfIS8Z1AxY-2asw7hizQFMDaoGEI_IgWklKtUo85gcwPCmargST8mznEcAUEzrA_l2cxer2fkhLEj7Kd7RPMSVZj9gt09h-U63SOewhDn8QroNSPM-09jT2f0Mc2nRpSLDnKlbOrq51D28npMnvZsyvvhzX5CvV-9vLj9W118-fLp8d115qc1WSewlaClFq4H7FuTRdYo3AhGF51Iw3zctHluulOykcH1nsFEaOqHNEdujuCCvz7lrij92zJudQ_Y4TW7BuGdrQBkpQYqifPWPcox7WspylhltGlmAFBE_i3yKOSfs7ZrC7NK9ZWBPpO1oT6TtibQFZQvpYvp8NiVc0f91lD-UUeijvbXCMc7LeV_qwSpcOLWl1lKqFVYpYYdtLmlvz2lYsN0GTDb7gIvHLiT0m-1i-N8yvwH5YqCZ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>198954718</pqid></control><display><type>article</type><title>Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Moslehi, G. ; Mirzaee, M. ; Vasei, M. ; Modarres, M. ; Azaron, A.</creator><creatorcontrib>Moslehi, G. ; Mirzaee, M. ; Vasei, M. ; Modarres, M. ; Azaron, A.</creatorcontrib><description>This paper presents optimal scheduling in a two-machine flow shop, in which the objective function is to minimize the sum of maximum earliness and tardiness (
n/2/
P/
ET
max
). Since this problem tries to minimize earliness and tardiness, the results can be useful for different production systems such as just in time (JIT). This objective function has already been considered for
n jobs and
m machines, but the proposed algorithms are not efficient to solve large scale problems. In this paper, neighborhood conditions are developed and the dominant set for any optimal solution is determined. The branch-and-bound (B&B) method is used to solve the problem and the proper upper and lower bounds are also introduced. A number of effective lemmas are introduced to develop an algorithm which is more efficient than those already known. To show the effectiveness of the proposed algorithm, 380 problems of different sizes are randomly generated and solved. More than 82% of the problems are shown to reach optimal solutions.</description><identifier>ISSN: 0925-5273</identifier><identifier>EISSN: 1873-7579</identifier><identifier>DOI: 10.1016/j.ijpe.2009.07.003</identifier><identifier>CODEN: IJPCEY</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Branch & bound algorithms ; Branch-and-bound ; Economics ; Flow control ; Flow shop ; Job shops ; Just in time ; Just-in-time (JIT) systems ; Lower bounds ; Machine shops ; Optimization ; Optimization algorithms ; Production scheduling ; Scheduling ; Scheduling Flow shop Branch-and-bound Just-in-time (JIT) systems ; Studies</subject><ispartof>International journal of production economics, 2009-12, Vol.122 (2), p.763-773</ispartof><rights>2009 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Dec 2009</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c489t-4ef4084436802c604bad7253eee3c2431cf56eb62774d43afd9e5780d389be6b3</citedby><cites>FETCH-LOGICAL-c489t-4ef4084436802c604bad7253eee3c2431cf56eb62774d43afd9e5780d389be6b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0925527309002424$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,3994,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeproeco/v_3a122_3ay_3a2009_3ai_3a2_3ap_3a763-773.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Moslehi, G.</creatorcontrib><creatorcontrib>Mirzaee, M.</creatorcontrib><creatorcontrib>Vasei, M.</creatorcontrib><creatorcontrib>Modarres, M.</creatorcontrib><creatorcontrib>Azaron, A.</creatorcontrib><title>Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness</title><title>International journal of production economics</title><description>This paper presents optimal scheduling in a two-machine flow shop, in which the objective function is to minimize the sum of maximum earliness and tardiness (
n/2/
P/
ET
max
). Since this problem tries to minimize earliness and tardiness, the results can be useful for different production systems such as just in time (JIT). This objective function has already been considered for
n jobs and
m machines, but the proposed algorithms are not efficient to solve large scale problems. In this paper, neighborhood conditions are developed and the dominant set for any optimal solution is determined. The branch-and-bound (B&B) method is used to solve the problem and the proper upper and lower bounds are also introduced. A number of effective lemmas are introduced to develop an algorithm which is more efficient than those already known. To show the effectiveness of the proposed algorithm, 380 problems of different sizes are randomly generated and solved. More than 82% of the problems are shown to reach optimal solutions.</description><subject>Algorithms</subject><subject>Branch & bound algorithms</subject><subject>Branch-and-bound</subject><subject>Economics</subject><subject>Flow control</subject><subject>Flow shop</subject><subject>Job shops</subject><subject>Just in time</subject><subject>Just-in-time (JIT) systems</subject><subject>Lower bounds</subject><subject>Machine shops</subject><subject>Optimization</subject><subject>Optimization algorithms</subject><subject>Production scheduling</subject><subject>Scheduling</subject><subject>Scheduling Flow shop Branch-and-bound Just-in-time (JIT) systems</subject><subject>Studies</subject><issn>0925-5273</issn><issn>1873-7579</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9kM1u1TAQhS0EEpfCC7Cy2LBKGP8ktiU2qKKAqMSmiKXl60yIoyQOdtJSnh7fXsSCBYuxx9I5Z8YfIS8Z1AxY-2asw7hizQFMDaoGEI_IgWklKtUo85gcwPCmargST8mznEcAUEzrA_l2cxer2fkhLEj7Kd7RPMSVZj9gt09h-U63SOewhDn8QroNSPM-09jT2f0Mc2nRpSLDnKlbOrq51D28npMnvZsyvvhzX5CvV-9vLj9W118-fLp8d115qc1WSewlaClFq4H7FuTRdYo3AhGF51Iw3zctHluulOykcH1nsFEaOqHNEdujuCCvz7lrij92zJudQ_Y4TW7BuGdrQBkpQYqifPWPcox7WspylhltGlmAFBE_i3yKOSfs7ZrC7NK9ZWBPpO1oT6TtibQFZQvpYvp8NiVc0f91lD-UUeijvbXCMc7LeV_qwSpcOLWl1lKqFVYpYYdtLmlvz2lYsN0GTDb7gIvHLiT0m-1i-N8yvwH5YqCZ</recordid><startdate>20091201</startdate><enddate>20091201</enddate><creator>Moslehi, G.</creator><creator>Mirzaee, M.</creator><creator>Vasei, M.</creator><creator>Modarres, M.</creator><creator>Azaron, A.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TA</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JG9</scope><scope>KR7</scope></search><sort><creationdate>20091201</creationdate><title>Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness</title><author>Moslehi, G. ; Mirzaee, M. ; Vasei, M. ; Modarres, M. ; Azaron, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c489t-4ef4084436802c604bad7253eee3c2431cf56eb62774d43afd9e5780d389be6b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algorithms</topic><topic>Branch & bound algorithms</topic><topic>Branch-and-bound</topic><topic>Economics</topic><topic>Flow control</topic><topic>Flow shop</topic><topic>Job shops</topic><topic>Just in time</topic><topic>Just-in-time (JIT) systems</topic><topic>Lower bounds</topic><topic>Machine shops</topic><topic>Optimization</topic><topic>Optimization algorithms</topic><topic>Production scheduling</topic><topic>Scheduling</topic><topic>Scheduling Flow shop Branch-and-bound Just-in-time (JIT) systems</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Moslehi, G.</creatorcontrib><creatorcontrib>Mirzaee, M.</creatorcontrib><creatorcontrib>Vasei, M.</creatorcontrib><creatorcontrib>Modarres, M.</creatorcontrib><creatorcontrib>Azaron, A.</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</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>Civil Engineering Abstracts</collection><jtitle>International journal of production economics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Moslehi, G.</au><au>Mirzaee, M.</au><au>Vasei, M.</au><au>Modarres, M.</au><au>Azaron, A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness</atitle><jtitle>International journal of production economics</jtitle><date>2009-12-01</date><risdate>2009</risdate><volume>122</volume><issue>2</issue><spage>763</spage><epage>773</epage><pages>763-773</pages><issn>0925-5273</issn><eissn>1873-7579</eissn><coden>IJPCEY</coden><abstract>This paper presents optimal scheduling in a two-machine flow shop, in which the objective function is to minimize the sum of maximum earliness and tardiness (
n/2/
P/
ET
max
). Since this problem tries to minimize earliness and tardiness, the results can be useful for different production systems such as just in time (JIT). This objective function has already been considered for
n jobs and
m machines, but the proposed algorithms are not efficient to solve large scale problems. In this paper, neighborhood conditions are developed and the dominant set for any optimal solution is determined. The branch-and-bound (B&B) method is used to solve the problem and the proper upper and lower bounds are also introduced. A number of effective lemmas are introduced to develop an algorithm which is more efficient than those already known. To show the effectiveness of the proposed algorithm, 380 problems of different sizes are randomly generated and solved. More than 82% of the problems are shown to reach optimal solutions.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ijpe.2009.07.003</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0925-5273 |
| ispartof | International journal of production economics, 2009-12, Vol.122 (2), p.763-773 |
| issn | 0925-5273 1873-7579 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_907944043 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Algorithms Branch & bound algorithms Branch-and-bound Economics Flow control Flow shop Job shops Just in time Just-in-time (JIT) systems Lower bounds Machine shops Optimization Optimization algorithms Production scheduling Scheduling Scheduling Flow shop Branch-and-bound Just-in-time (JIT) systems Studies |
| title | Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T06%3A36%3A34IST&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=Two-machine%20flow%20shop%20scheduling%20to%20minimize%20the%20sum%20of%20maximum%20earliness%20and%20tardiness&rft.jtitle=International%20journal%20of%20production%20economics&rft.au=Moslehi,%20G.&rft.date=2009-12-01&rft.volume=122&rft.issue=2&rft.spage=763&rft.epage=773&rft.pages=763-773&rft.issn=0925-5273&rft.eissn=1873-7579&rft.coden=IJPCEY&rft_id=info:doi/10.1016/j.ijpe.2009.07.003&rft_dat=%3Cproquest_cross%3E907944043%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=198954718&rft_id=info:pmid/&rft_els_id=S0925527309002424&rfr_iscdi=true |