Constraint programming models for the hybrid flow shop scheduling problem and its extensions
Proper scheduling of jobs is essential for modern production systems to work effectively. The hybrid flow shop scheduling problem is a scheduling problem with many applications in the industry. The problem has also attracted much attention from researchers due to its complexity. This study addresses...
Gespeichert in:
| Veröffentlicht in: | Soft computing (Berlin, Germany) Germany), 2023-12, Vol.27 (24), p.18623-18650 |
|---|---|
| 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 | 18650 |
|---|---|
| container_issue | 24 |
| container_start_page | 18623 |
| container_title | Soft computing (Berlin, Germany) |
| container_volume | 27 |
| creator | Işık, Eyüp Ensar Topaloglu Yildiz, Seyda Şatır Akpunar, Özge |
| description | Proper scheduling of jobs is essential for modern production systems to work effectively. The hybrid flow shop scheduling problem is a scheduling problem with many applications in the industry. The problem has also attracted much attention from researchers due to its complexity. This study addresses the hybrid flow shop scheduling problem (HFSP), which considers unrelated parallel machines at each stage and the machine eligibility constraints. HFSP is a well-known NP-hard problem with the aim of minimizing the makespan. Owing to the complexity of the problem, this study develops constraint programming (CP) models for the HFSP and its extensions: the no-wait HFSP, the blocking HFSP, the HFSP with sequence-dependent setup times, the no-wait HFSP with sequence-dependent setup times, and the blocking HFSP with sequence-dependent setup times. We also propose two mixed-integer linear programming models (MILP) for no-wait and blocking HSFPs with sequence-dependent setup times. The performances of the CP models were tested against their MILP counterparts using randomly generated instances and benchmark instances from the literature. The computational results indicated that the proposed CP model outperformed the best MILP solutions for benchmark instances. It is also more effective for finding high-quality solutions for larger problem instances. |
| doi_str_mv | 10.1007/s00500-023-09086-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918001230</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918001230</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-c25ec4a6f38242ebfa7ee3ce57a4b925610a98ebda010b8f2648dfb1405bb04b3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKt_wFPAc3TysR85SvELCl70JoRkd7a7ZXdTky3af2_aCt48zRye553hJeSawy0HKO4iQAbAQEgGGsqc6RMy40pKVqhCnx52wYpcyXNyEeMaQPAikzPysfBjnILtxolugl8FOwzduKKDr7GPtPGBTi3SdudCV9Om9180tn5DY9Vive33aNJcjwO1Y027KVL8nnCMXcq9JGeN7SNe_c45eX98eFs8s-Xr08vifskqyfXEKpFhpWzeyFIoga6xBaKsMCusclpkOQerS3S1BQ6ubESuyrpxXEHmHCgn5-TmmJte-dxinMzab8OYThqheQnAhYREiSNVBR9jwMZsQjfYsDMczL5Fc2zRpBbNoUWjkySPUkzwuMLwF_2P9QPi1HbA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918001230</pqid></control><display><type>article</type><title>Constraint programming models for the hybrid flow shop scheduling problem and its extensions</title><source>SpringerNature Journals</source><source>ProQuest Central UK/Ireland</source><source>ProQuest Central</source><creator>Işık, Eyüp Ensar ; Topaloglu Yildiz, Seyda ; Şatır Akpunar, Özge</creator><creatorcontrib>Işık, Eyüp Ensar ; Topaloglu Yildiz, Seyda ; Şatır Akpunar, Özge</creatorcontrib><description>Proper scheduling of jobs is essential for modern production systems to work effectively. The hybrid flow shop scheduling problem is a scheduling problem with many applications in the industry. The problem has also attracted much attention from researchers due to its complexity. This study addresses the hybrid flow shop scheduling problem (HFSP), which considers unrelated parallel machines at each stage and the machine eligibility constraints. HFSP is a well-known NP-hard problem with the aim of minimizing the makespan. Owing to the complexity of the problem, this study develops constraint programming (CP) models for the HFSP and its extensions: the no-wait HFSP, the blocking HFSP, the HFSP with sequence-dependent setup times, the no-wait HFSP with sequence-dependent setup times, and the blocking HFSP with sequence-dependent setup times. We also propose two mixed-integer linear programming models (MILP) for no-wait and blocking HSFPs with sequence-dependent setup times. The performances of the CP models were tested against their MILP counterparts using randomly generated instances and benchmark instances from the literature. The computational results indicated that the proposed CP model outperformed the best MILP solutions for benchmark instances. It is also more effective for finding high-quality solutions for larger problem instances.</description><identifier>ISSN: 1432-7643</identifier><identifier>EISSN: 1433-7479</identifier><identifier>DOI: 10.1007/s00500-023-09086-9</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Artificial Intelligence ; Benchmarks ; Complexity ; Computational Intelligence ; Constraint modelling ; Control ; Energy consumption ; Engineering ; Heuristic ; Integer programming ; Job shop scheduling ; Linear programming ; Literature reviews ; Manufacturing ; Mathematical Logic and Foundations ; Mechatronics ; Mixed integer ; Optimization ; Optimization algorithms ; Production capacity ; Robotics ; Scheduling ; Setup times ; System effectiveness</subject><ispartof>Soft computing (Berlin, Germany), 2023-12, Vol.27 (24), p.18623-18650</ispartof><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-c25ec4a6f38242ebfa7ee3ce57a4b925610a98ebda010b8f2648dfb1405bb04b3</citedby><cites>FETCH-LOGICAL-c319t-c25ec4a6f38242ebfa7ee3ce57a4b925610a98ebda010b8f2648dfb1405bb04b3</cites><orcidid>0000-0001-6827-126X ; 0000-0002-9180-0243 ; 0000-0003-4112-2533</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00500-023-09086-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918001230?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,21388,27924,27925,33744,41488,42557,43805,51319,64385,64389,72469</link.rule.ids></links><search><creatorcontrib>Işık, Eyüp Ensar</creatorcontrib><creatorcontrib>Topaloglu Yildiz, Seyda</creatorcontrib><creatorcontrib>Şatır Akpunar, Özge</creatorcontrib><title>Constraint programming models for the hybrid flow shop scheduling problem and its extensions</title><title>Soft computing (Berlin, Germany)</title><addtitle>Soft Comput</addtitle><description>Proper scheduling of jobs is essential for modern production systems to work effectively. The hybrid flow shop scheduling problem is a scheduling problem with many applications in the industry. The problem has also attracted much attention from researchers due to its complexity. This study addresses the hybrid flow shop scheduling problem (HFSP), which considers unrelated parallel machines at each stage and the machine eligibility constraints. HFSP is a well-known NP-hard problem with the aim of minimizing the makespan. Owing to the complexity of the problem, this study develops constraint programming (CP) models for the HFSP and its extensions: the no-wait HFSP, the blocking HFSP, the HFSP with sequence-dependent setup times, the no-wait HFSP with sequence-dependent setup times, and the blocking HFSP with sequence-dependent setup times. We also propose two mixed-integer linear programming models (MILP) for no-wait and blocking HSFPs with sequence-dependent setup times. The performances of the CP models were tested against their MILP counterparts using randomly generated instances and benchmark instances from the literature. The computational results indicated that the proposed CP model outperformed the best MILP solutions for benchmark instances. It is also more effective for finding high-quality solutions for larger problem instances.</description><subject>Artificial Intelligence</subject><subject>Benchmarks</subject><subject>Complexity</subject><subject>Computational Intelligence</subject><subject>Constraint modelling</subject><subject>Control</subject><subject>Energy consumption</subject><subject>Engineering</subject><subject>Heuristic</subject><subject>Integer programming</subject><subject>Job shop scheduling</subject><subject>Linear programming</subject><subject>Literature reviews</subject><subject>Manufacturing</subject><subject>Mathematical Logic and Foundations</subject><subject>Mechatronics</subject><subject>Mixed integer</subject><subject>Optimization</subject><subject>Optimization algorithms</subject><subject>Production capacity</subject><subject>Robotics</subject><subject>Scheduling</subject><subject>Setup times</subject><subject>System effectiveness</subject><issn>1432-7643</issn><issn>1433-7479</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kE1LAzEQhoMoWKt_wFPAc3TysR85SvELCl70JoRkd7a7ZXdTky3af2_aCt48zRye553hJeSawy0HKO4iQAbAQEgGGsqc6RMy40pKVqhCnx52wYpcyXNyEeMaQPAikzPysfBjnILtxolugl8FOwzduKKDr7GPtPGBTi3SdudCV9Om9180tn5DY9Vive33aNJcjwO1Y027KVL8nnCMXcq9JGeN7SNe_c45eX98eFs8s-Xr08vifskqyfXEKpFhpWzeyFIoga6xBaKsMCusclpkOQerS3S1BQ6ubESuyrpxXEHmHCgn5-TmmJte-dxinMzab8OYThqheQnAhYREiSNVBR9jwMZsQjfYsDMczL5Fc2zRpBbNoUWjkySPUkzwuMLwF_2P9QPi1HbA</recordid><startdate>20231201</startdate><enddate>20231201</enddate><creator>Işık, Eyüp Ensar</creator><creator>Topaloglu Yildiz, Seyda</creator><creator>Şatır Akpunar, Özge</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><orcidid>https://orcid.org/0000-0001-6827-126X</orcidid><orcidid>https://orcid.org/0000-0002-9180-0243</orcidid><orcidid>https://orcid.org/0000-0003-4112-2533</orcidid></search><sort><creationdate>20231201</creationdate><title>Constraint programming models for the hybrid flow shop scheduling problem and its extensions</title><author>Işık, Eyüp Ensar ; Topaloglu Yildiz, Seyda ; Şatır Akpunar, Özge</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-c25ec4a6f38242ebfa7ee3ce57a4b925610a98ebda010b8f2648dfb1405bb04b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Artificial Intelligence</topic><topic>Benchmarks</topic><topic>Complexity</topic><topic>Computational Intelligence</topic><topic>Constraint modelling</topic><topic>Control</topic><topic>Energy consumption</topic><topic>Engineering</topic><topic>Heuristic</topic><topic>Integer programming</topic><topic>Job shop scheduling</topic><topic>Linear programming</topic><topic>Literature reviews</topic><topic>Manufacturing</topic><topic>Mathematical Logic and Foundations</topic><topic>Mechatronics</topic><topic>Mixed integer</topic><topic>Optimization</topic><topic>Optimization algorithms</topic><topic>Production capacity</topic><topic>Robotics</topic><topic>Scheduling</topic><topic>Setup times</topic><topic>System effectiveness</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Işık, Eyüp Ensar</creatorcontrib><creatorcontrib>Topaloglu Yildiz, Seyda</creatorcontrib><creatorcontrib>Şatır Akpunar, Özge</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Soft computing (Berlin, Germany)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Işık, Eyüp Ensar</au><au>Topaloglu Yildiz, Seyda</au><au>Şatır Akpunar, Özge</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Constraint programming models for the hybrid flow shop scheduling problem and its extensions</atitle><jtitle>Soft computing (Berlin, Germany)</jtitle><stitle>Soft Comput</stitle><date>2023-12-01</date><risdate>2023</risdate><volume>27</volume><issue>24</issue><spage>18623</spage><epage>18650</epage><pages>18623-18650</pages><issn>1432-7643</issn><eissn>1433-7479</eissn><abstract>Proper scheduling of jobs is essential for modern production systems to work effectively. The hybrid flow shop scheduling problem is a scheduling problem with many applications in the industry. The problem has also attracted much attention from researchers due to its complexity. This study addresses the hybrid flow shop scheduling problem (HFSP), which considers unrelated parallel machines at each stage and the machine eligibility constraints. HFSP is a well-known NP-hard problem with the aim of minimizing the makespan. Owing to the complexity of the problem, this study develops constraint programming (CP) models for the HFSP and its extensions: the no-wait HFSP, the blocking HFSP, the HFSP with sequence-dependent setup times, the no-wait HFSP with sequence-dependent setup times, and the blocking HFSP with sequence-dependent setup times. We also propose two mixed-integer linear programming models (MILP) for no-wait and blocking HSFPs with sequence-dependent setup times. The performances of the CP models were tested against their MILP counterparts using randomly generated instances and benchmark instances from the literature. The computational results indicated that the proposed CP model outperformed the best MILP solutions for benchmark instances. It is also more effective for finding high-quality solutions for larger problem instances.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s00500-023-09086-9</doi><tpages>28</tpages><orcidid>https://orcid.org/0000-0001-6827-126X</orcidid><orcidid>https://orcid.org/0000-0002-9180-0243</orcidid><orcidid>https://orcid.org/0000-0003-4112-2533</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1432-7643 |
| ispartof | Soft computing (Berlin, Germany), 2023-12, Vol.27 (24), p.18623-18650 |
| issn | 1432-7643 1433-7479 |
| language | eng |
| recordid | cdi_proquest_journals_2918001230 |
| source | SpringerNature Journals; ProQuest Central UK/Ireland; ProQuest Central |
| subjects | Artificial Intelligence Benchmarks Complexity Computational Intelligence Constraint modelling Control Energy consumption Engineering Heuristic Integer programming Job shop scheduling Linear programming Literature reviews Manufacturing Mathematical Logic and Foundations Mechatronics Mixed integer Optimization Optimization algorithms Production capacity Robotics Scheduling Setup times System effectiveness |
| title | Constraint programming models for the hybrid flow shop scheduling problem and its extensions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T21%3A13%3A13IST&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=Constraint%20programming%20models%20for%20the%20hybrid%20flow%20shop%20scheduling%20problem%20and%20its%20extensions&rft.jtitle=Soft%20computing%20(Berlin,%20Germany)&rft.au=I%C5%9F%C4%B1k,%20Ey%C3%BCp%20Ensar&rft.date=2023-12-01&rft.volume=27&rft.issue=24&rft.spage=18623&rft.epage=18650&rft.pages=18623-18650&rft.issn=1432-7643&rft.eissn=1433-7479&rft_id=info:doi/10.1007/s00500-023-09086-9&rft_dat=%3Cproquest_cross%3E2918001230%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=2918001230&rft_id=info:pmid/&rfr_iscdi=true |