A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
This paper considers a two-stage hybrid flow shop scheduling problem with dedicated machines at stage 2. The objective is to minimise the makespan. There is one machine at stage 1 and two machines at stage 2. Each job must be processed on the single machine at stage 1 and, depending upon the job typ...
Gespeichert in:
| Veröffentlicht in: | International journal of production research 2010-03, Vol.48 (5), p.1531-1538 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1538 |
|---|---|
| container_issue | 5 |
| container_start_page | 1531 |
| container_title | International journal of production research |
| container_volume | 48 |
| creator | Yang, Jaehwan |
| description | This paper considers a two-stage hybrid flow shop scheduling problem with dedicated machines at stage 2. The objective is to minimise the makespan. There is one machine at stage 1 and two machines at stage 2. Each job must be processed on the single machine at stage 1 and, depending upon the job type, the job is processed on either of the two machines at stage 2. We first introduce this special type of the two-stage hybrid flow shop scheduling problem and present some preliminary results. We then present a counter example to the known complexity proof of Riane et al. [Riane, F., Artiba, A. and Elmaghraby, S.E., 2002. Sequencing a hybrid two-stage flowshop with dedicated machines. International Journal of Production Research, 40, 4353-4380.] Finally, we re-establish the complexity of the problem. |
| doi_str_mv | 10.1080/00207540802691374 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_proquest_miscellaneous_753658801</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>753658801</sourcerecordid><originalsourceid>FETCH-LOGICAL-c435t-48dc566e27eb77c3d507c9d832b6e8cfe733586d725a7c440d5dc076c4c5ac7f3</originalsourceid><addsrcrecordid>eNqFkE2LFDEQhoMoOK7-AG9BEE-tSedzwcuyqCsseFHw1mQq1dtZ0p0xydA7_94Ms-vBBc2lAvU8VcVLyGvO3nNm2QfGemaUbN9en3Nh5BOy4ULrTln78ynZHPtdA8Rz8qKUW9aesnJD_AVdcKWQ5l3Eu1APdJdTGumYMq0T0rqmrlR3g3Q6bHPwdIxppWVKO1pgQr-PYbk5OtuIM11DnahHH8BV9HR2MIUFy0vybHSx4Kv7ekZ-fP70_fKqu_725evlxXUHUqjaSetBaY29wa0xILxiBs69Ff1Wo4URjRDKam965QxIybzywIwGCcqBGcUZeXea2-75tcdShzkUwBjdgmlfBqOEbnkw3sg3f5G3aZ-XdtzQc6s1t1Y2iJ8gyKmUjOOwy2F2-TBwNhxTHx6l3py394NdARfH7BYI5Y_Y90JaJlTjPp64sLSoZ7emHP1Q3SGm_CCJf60x_9UfWUO9q-I3bKGnQg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>218661884</pqid></control><display><type>article</type><title>A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines</title><source>Business Source Complete</source><source>Taylor & Francis Online</source><creator>Yang, Jaehwan</creator><creatorcontrib>Yang, Jaehwan</creatorcontrib><description>This paper considers a two-stage hybrid flow shop scheduling problem with dedicated machines at stage 2. The objective is to minimise the makespan. There is one machine at stage 1 and two machines at stage 2. Each job must be processed on the single machine at stage 1 and, depending upon the job type, the job is processed on either of the two machines at stage 2. We first introduce this special type of the two-stage hybrid flow shop scheduling problem and present some preliminary results. We then present a counter example to the known complexity proof of Riane et al. [Riane, F., Artiba, A. and Elmaghraby, S.E., 2002. Sequencing a hybrid two-stage flowshop with dedicated machines. International Journal of Production Research, 40, 4353-4380.] Finally, we re-establish the complexity of the problem.</description><identifier>ISSN: 0020-7543</identifier><identifier>EISSN: 1366-588X</identifier><identifier>DOI: 10.1080/00207540802691374</identifier><identifier>CODEN: IJPRB8</identifier><language>eng</language><publisher>Abingdon: Taylor & Francis Group</publisher><subject>Applied sciences ; Complexity ; computational complexity ; Exact sciences and technology ; hybrid flow shop ; Inventory control, production control. Distribution ; Job shops ; Machine shops ; Operational research and scientific management ; Operational research. Management science ; Production scheduling ; Proving ; Scheduling ; Scheduling, sequencing ; Sequencing ; Studies</subject><ispartof>International journal of production research, 2010-03, Vol.48 (5), p.1531-1538</ispartof><rights>Copyright Taylor & Francis Group, LLC 2010</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Taylor & Francis Group 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c435t-48dc566e27eb77c3d507c9d832b6e8cfe733586d725a7c440d5dc076c4c5ac7f3</citedby><cites>FETCH-LOGICAL-c435t-48dc566e27eb77c3d507c9d832b6e8cfe733586d725a7c440d5dc076c4c5ac7f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/00207540802691374$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/00207540802691374$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,59647,60436</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22348035$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Yang, Jaehwan</creatorcontrib><title>A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines</title><title>International journal of production research</title><description>This paper considers a two-stage hybrid flow shop scheduling problem with dedicated machines at stage 2. The objective is to minimise the makespan. There is one machine at stage 1 and two machines at stage 2. Each job must be processed on the single machine at stage 1 and, depending upon the job type, the job is processed on either of the two machines at stage 2. We first introduce this special type of the two-stage hybrid flow shop scheduling problem and present some preliminary results. We then present a counter example to the known complexity proof of Riane et al. [Riane, F., Artiba, A. and Elmaghraby, S.E., 2002. Sequencing a hybrid two-stage flowshop with dedicated machines. International Journal of Production Research, 40, 4353-4380.] Finally, we re-establish the complexity of the problem.</description><subject>Applied sciences</subject><subject>Complexity</subject><subject>computational complexity</subject><subject>Exact sciences and technology</subject><subject>hybrid flow shop</subject><subject>Inventory control, production control. Distribution</subject><subject>Job shops</subject><subject>Machine shops</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Production scheduling</subject><subject>Proving</subject><subject>Scheduling</subject><subject>Scheduling, sequencing</subject><subject>Sequencing</subject><subject>Studies</subject><issn>0020-7543</issn><issn>1366-588X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNqFkE2LFDEQhoMoOK7-AG9BEE-tSedzwcuyqCsseFHw1mQq1dtZ0p0xydA7_94Ms-vBBc2lAvU8VcVLyGvO3nNm2QfGemaUbN9en3Nh5BOy4ULrTln78ynZHPtdA8Rz8qKUW9aesnJD_AVdcKWQ5l3Eu1APdJdTGumYMq0T0rqmrlR3g3Q6bHPwdIxppWVKO1pgQr-PYbk5OtuIM11DnahHH8BV9HR2MIUFy0vybHSx4Kv7ekZ-fP70_fKqu_725evlxXUHUqjaSetBaY29wa0xILxiBs69Ff1Wo4URjRDKam965QxIybzywIwGCcqBGcUZeXea2-75tcdShzkUwBjdgmlfBqOEbnkw3sg3f5G3aZ-XdtzQc6s1t1Y2iJ8gyKmUjOOwy2F2-TBwNhxTHx6l3py394NdARfH7BYI5Y_Y90JaJlTjPp64sLSoZ7emHP1Q3SGm_CCJf60x_9UfWUO9q-I3bKGnQg</recordid><startdate>20100301</startdate><enddate>20100301</enddate><creator>Yang, Jaehwan</creator><general>Taylor & Francis Group</general><general>Taylor & Francis</general><general>Taylor & Francis LLC</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20100301</creationdate><title>A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines</title><author>Yang, Jaehwan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c435t-48dc566e27eb77c3d507c9d832b6e8cfe733586d725a7c440d5dc076c4c5ac7f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Applied sciences</topic><topic>Complexity</topic><topic>computational complexity</topic><topic>Exact sciences and technology</topic><topic>hybrid flow shop</topic><topic>Inventory control, production control. Distribution</topic><topic>Job shops</topic><topic>Machine shops</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Production scheduling</topic><topic>Proving</topic><topic>Scheduling</topic><topic>Scheduling, sequencing</topic><topic>Sequencing</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Jaehwan</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</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>International journal of production research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yang, Jaehwan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines</atitle><jtitle>International journal of production research</jtitle><date>2010-03-01</date><risdate>2010</risdate><volume>48</volume><issue>5</issue><spage>1531</spage><epage>1538</epage><pages>1531-1538</pages><issn>0020-7543</issn><eissn>1366-588X</eissn><coden>IJPRB8</coden><abstract>This paper considers a two-stage hybrid flow shop scheduling problem with dedicated machines at stage 2. The objective is to minimise the makespan. There is one machine at stage 1 and two machines at stage 2. Each job must be processed on the single machine at stage 1 and, depending upon the job type, the job is processed on either of the two machines at stage 2. We first introduce this special type of the two-stage hybrid flow shop scheduling problem and present some preliminary results. We then present a counter example to the known complexity proof of Riane et al. [Riane, F., Artiba, A. and Elmaghraby, S.E., 2002. Sequencing a hybrid two-stage flowshop with dedicated machines. International Journal of Production Research, 40, 4353-4380.] Finally, we re-establish the complexity of the problem.</abstract><cop>Abingdon</cop><pub>Taylor & Francis Group</pub><doi>10.1080/00207540802691374</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-7543 |
| ispartof | International journal of production research, 2010-03, Vol.48 (5), p.1531-1538 |
| issn | 0020-7543 1366-588X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_753658801 |
| source | Business Source Complete; Taylor & Francis Online |
| subjects | Applied sciences Complexity computational complexity Exact sciences and technology hybrid flow shop Inventory control, production control. Distribution Job shops Machine shops Operational research and scientific management Operational research. Management science Production scheduling Proving Scheduling Scheduling, sequencing Sequencing Studies |
| title | A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T08%3A59%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20new%20complexity%20proof%20for%20the%20two-stage%20hybrid%20flow%20shop%20scheduling%20problem%20with%20dedicated%20machines&rft.jtitle=International%20journal%20of%20production%20research&rft.au=Yang,%20Jaehwan&rft.date=2010-03-01&rft.volume=48&rft.issue=5&rft.spage=1531&rft.epage=1538&rft.pages=1531-1538&rft.issn=0020-7543&rft.eissn=1366-588X&rft.coden=IJPRB8&rft_id=info:doi/10.1080/00207540802691374&rft_dat=%3Cproquest_pasca%3E753658801%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=218661884&rft_id=info:pmid/&rfr_iscdi=true |