Scheduling to minimize the makespan in large-piece one-of-a-kind production with machine availability constraints
•Focus on scheduling of an LP-OKP model with machines availability constraints.•Propose slack-based mixed integer linear programming scheduling algorithm.•Propose slot-based search scheduling algorithm.•Evaluate the proposed algorithms through a real case of power plant building industry. This paper...
Uloženo v:
| Vydáno v: | Expert systems with applications Ročník 42; číslo 23; s. 9174 - 9182 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
15.12.2015
|
| Témata: | |
| ISSN: | 0957-4174, 1873-6793 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •Focus on scheduling of an LP-OKP model with machines availability constraints.•Propose slack-based mixed integer linear programming scheduling algorithm.•Propose slot-based search scheduling algorithm.•Evaluate the proposed algorithms through a real case of power plant building industry.
This paper addresses a job shop scheduling problem, in which the jobs belong to the large-piece one-of-a-kind production (LP-OKP) model, and the machines are subject to availability constraints (Jm(LP-OKP), hjk |r-a |Cmax). The objective is considered to minimize the makespan. The scheduling model is derived from real industries, such as ship building industry, power plant building industry, steel-structure building industry and so on, and represents a more realistic and complex situation. In this study, two different scheduling algorithms of a slack-based mixed integer linear programming (MILP) model and a time slot-based search method are proposed to solve the scheduling problem. The experiments are implemented on CPLEX and search scheduling platform, respectively. The results reveal that the slack-based MILP model and time slot-based search method give better solutions than the rule-based algorithm. The deviation of objective optimal value results show that the slack-based MILP model and time slot-based search method can improve the makespan solution by 0.7% and 5.6%, respectively. And the percentage improvement of CPU time results show that they can shorten the CPU time by 74.5% and 12.9%, respectively. We found that the performance of the time slot-based search method is significantly competitive as compared to the slack-based MILP model but its CPU time is significantly higher than that of the slack-based MILP model. |
|---|---|
| AbstractList | This paper addresses a job shop scheduling problem, in which the jobs belong to the large-piece one-of-a-kind production (LP-OKP) model, and the machines are subject to availability constraints (J sub(m)(LP-OKP), h sub(jk) |r-a |C sub(max)). The objective is considered to minimize the makespan. The scheduling model is derived from real industries, such as ship building industry, power plant building industry, steel-structure building industry and so on, and represents a more realistic and complex situation. In this study, two different scheduling algorithms of a slack-based mixed integer linear programming (MILP) model and a time slot-based search method are proposed to solve the scheduling problem. The experiments are implemented on CPLEX and search scheduling platform, respectively. The results reveal that the slack-based MILP model and time slot-based search method give better solutions than the rule-based algorithm. The deviation of objective optimal value results show that the slack-based MILP model and time slot-based search method can improve the makespan solution by 0.7% and 5.6%, respectively. And the percentage improvement of CPU time results show that they can shorten the CPU time by 74.5% and 12.9%, respectively. We found that the performance of the time slot-based search method is significantly competitive as compared to the slack-based MILP model but its CPU time is significantly higher than that of the slack-based MILP model. •Focus on scheduling of an LP-OKP model with machines availability constraints.•Propose slack-based mixed integer linear programming scheduling algorithm.•Propose slot-based search scheduling algorithm.•Evaluate the proposed algorithms through a real case of power plant building industry. This paper addresses a job shop scheduling problem, in which the jobs belong to the large-piece one-of-a-kind production (LP-OKP) model, and the machines are subject to availability constraints (Jm(LP-OKP), hjk |r-a |Cmax). The objective is considered to minimize the makespan. The scheduling model is derived from real industries, such as ship building industry, power plant building industry, steel-structure building industry and so on, and represents a more realistic and complex situation. In this study, two different scheduling algorithms of a slack-based mixed integer linear programming (MILP) model and a time slot-based search method are proposed to solve the scheduling problem. The experiments are implemented on CPLEX and search scheduling platform, respectively. The results reveal that the slack-based MILP model and time slot-based search method give better solutions than the rule-based algorithm. The deviation of objective optimal value results show that the slack-based MILP model and time slot-based search method can improve the makespan solution by 0.7% and 5.6%, respectively. And the percentage improvement of CPU time results show that they can shorten the CPU time by 74.5% and 12.9%, respectively. We found that the performance of the time slot-based search method is significantly competitive as compared to the slack-based MILP model but its CPU time is significantly higher than that of the slack-based MILP model. |
| Author | Li, You Jia, Wenyou Jiang, Zhibin |
| Author_xml | – sequence: 1 givenname: Wenyou surname: Jia fullname: Jia, Wenyou email: jiawy@sjtu.edu.cn organization: School of Mechanical and Automotive Engineering, Anhui Polytechnic University, Wuhu, China – sequence: 2 givenname: Zhibin surname: Jiang fullname: Jiang, Zhibin email: jiaahpu@126.com organization: Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, China – sequence: 3 givenname: You surname: Li fullname: Li, You email: liuahpu@126.com organization: Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, China |
| BookMark | eNp9kD1vHCEQhlHkSDk7-QOpKNOwgYVddqU0keWPSJZcOKkRYQffnHfhDJwt59eH1bly4Wqa95l55zklJyEGIOSr4I3gov--ayA_26blomv40HDRfiAbMWjJej3KE7LhY6eZElp9Iqc57zgXmnO9IY93bgvTYcZwT0ukCwZc8B_QsgW62AfIexsoBjrbdA9sj-CA1tMsembZA4aJ7lOcDq5gDPQZy7ZSbosBqH2yONu_OGN5oS6GXJLFUPJn8tHbOcOX13lG_lxe_D6_Zje3V7_Of94wJ6UsTHE3dQ5UrzmMTsmx5d2ohhYESKu0974brRwHYX0FXOdBaa7HqWKST9bLM_LtuLcWfDxALmbB7GCebYB4yEYMbad62feyRodj1KWYcwJvHBa7vrR2no3gZrVsdma1bFbLhg-mWq5o-wbdJ1xsenkf-nGEoP7_hJBMdgjBwYQJXDFTxPfw_-CImu8 |
| CitedBy_id | crossref_primary_10_1080_00207543_2023_2294114 crossref_primary_10_1016_j_eswa_2021_114608 crossref_primary_10_1016_j_cor_2024_106785 crossref_primary_10_1007_s00170_017_1461_0 crossref_primary_10_1155_2020_8548463 crossref_primary_10_1080_00207543_2021_2013565 crossref_primary_10_1007_s12204_019_2086_2 |
| Cites_doi | 10.3166/jesa.41.651-671 10.1002/nav.20122 10.1016/S0377-2217(03)00261-3 10.1016/S0167-6377(96)00041-7 10.1080/09537287.2013.835580 10.1016/S0305-0483(01)00048-2 10.1007/s00170-005-2534-z 10.1504/IJOR.2014.060414 10.1007/BF00121681 10.1016/S0377-2217(97)00452-9 10.1016/j.eswa.2010.07.138 10.1016/S0377-2217(96)90070-3 10.1016/j.ijpe.2007.01.014 10.1016/j.cor.2004.09.034 10.1016/j.cor.2007.10.013 10.1007/s002360050143 10.1016/S0167-6377(01)00079-7 10.1287/opre.12.5.655 10.1016/j.cie.2009.04.014 10.1145/321978.321985 10.1016/j.eswa.2014.10.043 10.1007/s001860200267 10.1016/S0377-2217(01)00083-2 10.1016/S0360-8352(99)00127-8 10.1057/palgrave.jors.2601025 10.1080/0951192X.2014.900859 10.1080/00207540701543593 10.1080/03052151003759117 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Ltd |
| Copyright_xml | – notice: 2015 Elsevier Ltd |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.eswa.2015.08.012 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-6793 |
| EndPage | 9182 |
| ExternalDocumentID | 10_1016_j_eswa_2015_08_012 S0957417415005515 |
| GroupedDBID | --K --M .DC .~1 0R~ 13V 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABBOA ABFNM ABMAC ABMVD ABUCO ABYKQ ACDAQ ACGFS ACHRH ACNTT ACRLP ACZNC ADBBV ADEZE ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGJBL AGUBO AGUMN AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM AXJTR BJAXD BKOJK BLXMC BNSAS CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W JJJVA KOM LG9 LY1 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSL SST SSV SSZ T5K TN5 ~G- 29G 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABJNI ABKBG ABUFD ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB G-2 HLZ HVGLF HZ~ R2- SBC SET SEW WUQ XPP ZMT ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c333t-40cd5ce4670e9c4392059482e1e3a47fff59a3981afc33c5fe47079d0cd30daf3 |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000362613000009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0957-4174 |
| IngestDate | Thu Oct 02 10:58:07 EDT 2025 Sat Nov 29 04:44:43 EST 2025 Tue Nov 18 22:29:01 EST 2025 Fri Feb 23 02:29:08 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 23 |
| Keywords | Time slot-based search method Large-piece one-of-a-kind production Availability constraints Slack-based mixed integer linear programming model |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c333t-40cd5ce4670e9c4392059482e1e3a47fff59a3981afc33c5fe47079d0cd30daf3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1825463663 |
| PQPubID | 23500 |
| PageCount | 9 |
| ParticipantIDs | proquest_miscellaneous_1825463663 crossref_citationtrail_10_1016_j_eswa_2015_08_012 crossref_primary_10_1016_j_eswa_2015_08_012 elsevier_sciencedirect_doi_10_1016_j_eswa_2015_08_012 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-12-15 |
| PublicationDateYYYYMMDD | 2015-12-15 |
| PublicationDate_xml | – month: 12 year: 2015 text: 2015-12-15 day: 15 |
| PublicationDecade | 2010 |
| PublicationTitle | Expert systems with applications |
| PublicationYear | 2015 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Bernard (bib0005) 2014; 25 Tu, Dean (bib0031) 2011 Tu, Xie, Kam (bib0032) 2006; 29 Espinouse, Formanowicz, Penz (bib0012) 2001; 52 Edis, Ozkarahan (bib0010) 2011; 43 Hoogeveen, Lenstra, Veltman (bib0016) 1996; 89 Sanlaville, Schmidt (bib0030) 1998; 35 Ma, Chu, Zuo (bib0025) 2010; 58 Kubzin, Strusevich, Breit, Schmidt (bib0019) 2006; 53 Breit, Schmidt, Strusevich (bib0007) 2001; 29 Sangsawang, Sethanan, Fujimoto, Gen (bib0029) 2015; 42 Gilmore, Gomory (bib0013) 1964; 12 Adrodegari, Bacchetti, Sicco, Pirola, Pinto (bib0001) 2013 Zribi, El Kamel, Borne (bib0035) 2008; 112 Golmakani, Namazi (bib0014) 2014; 19 Aggoune (bib0003) 2004; 153 Gonzalez, Sahni (bib0015) 1976; 23 Li, Yao, Yang, Wang (bib0024) 2015; 28 Safari, Sadjadi (bib0028) 2011; 38 Wortmann, Muntslag, Timmermans (bib0033) 1997 Lee (bib0022) 1999; 114 Zribi, El Kamel, Borne (bib0034) 2007; 41 Mauguière, Billaut, Bouquard (bib0026) 2003 Allaoui, Artiba (bib0004) 2006; 33 Lee (bib0023) 2004 Dean, Tu, Xue (bib0009) 2009; 47 Lee (bib0021) 1997; 20 Kubiak, Błażewicz, Formanowicz, Breit, Schmidt (bib0017) 2002; 136 Lee (bib0020) 1996; 9 Breit, Schmidt, Strusevich (bib0008) 2003; 57 Aggoune (bib0002) 2002 Błażewicz, Breit, Formanowicz, Kubiak, Schmidt (bib0006) 2001; 29 Espinouse, Formanowicz, Penz (bib0011) 1999; 37 Kubzin, Potts, Strusevich (bib0018) 2009; 36 Pinedo (bib0027) 2012 Gilmore (10.1016/j.eswa.2015.08.012_bib0013) 1964; 12 Edis (10.1016/j.eswa.2015.08.012_bib0010) 2011; 43 Pinedo (10.1016/j.eswa.2015.08.012_bib0027) 2012 Dean (10.1016/j.eswa.2015.08.012_bib0009) 2009; 47 Lee (10.1016/j.eswa.2015.08.012_bib0021) 1997; 20 Lee (10.1016/j.eswa.2015.08.012_bib0022) 1999; 114 Adrodegari (10.1016/j.eswa.2015.08.012_bib0001) 2013 Wortmann (10.1016/j.eswa.2015.08.012_bib0033) 1997 Zribi (10.1016/j.eswa.2015.08.012_bib0035) 2008; 112 Golmakani (10.1016/j.eswa.2015.08.012_bib0014) 2014; 19 Mauguière (10.1016/j.eswa.2015.08.012_bib0026) 2003 Bernard (10.1016/j.eswa.2015.08.012_bib0005) 2014; 25 Błażewicz (10.1016/j.eswa.2015.08.012_bib0006) 2001; 29 Breit (10.1016/j.eswa.2015.08.012_bib0007) 2001; 29 Kubzin (10.1016/j.eswa.2015.08.012_bib0019) 2006; 53 Espinouse (10.1016/j.eswa.2015.08.012_bib0011) 1999; 37 Kubzin (10.1016/j.eswa.2015.08.012_bib0018) 2009; 36 Safari (10.1016/j.eswa.2015.08.012_bib0028) 2011; 38 Aggoune (10.1016/j.eswa.2015.08.012_bib0002) 2002 Li (10.1016/j.eswa.2015.08.012_bib0024) 2015; 28 Tu (10.1016/j.eswa.2015.08.012_bib0031) 2011 Zribi (10.1016/j.eswa.2015.08.012_bib0034) 2007; 41 Lee (10.1016/j.eswa.2015.08.012_bib0023) 2004 Allaoui (10.1016/j.eswa.2015.08.012_bib0004) 2006; 33 Gonzalez (10.1016/j.eswa.2015.08.012_bib0015) 1976; 23 Hoogeveen (10.1016/j.eswa.2015.08.012_bib0016) 1996; 89 Kubiak (10.1016/j.eswa.2015.08.012_bib0017) 2002; 136 Tu (10.1016/j.eswa.2015.08.012_bib0032) 2006; 29 Espinouse (10.1016/j.eswa.2015.08.012_bib0012) 2001; 52 Aggoune (10.1016/j.eswa.2015.08.012_bib0003) 2004; 153 Lee (10.1016/j.eswa.2015.08.012_bib0020) 1996; 9 Sangsawang (10.1016/j.eswa.2015.08.012_bib0029) 2015; 42 Ma (10.1016/j.eswa.2015.08.012_bib0025) 2010; 58 Sanlaville (10.1016/j.eswa.2015.08.012_bib0030) 1998; 35 Breit (10.1016/j.eswa.2015.08.012_bib0008) 2003; 57 |
| References_xml | – volume: 36 start-page: 379 year: 2009 end-page: 390 ident: bib0018 article-title: Approximation results for flow shop scheduling problems with machine availability constraints publication-title: Computers & Operations Research – volume: 41 start-page: 651 year: 2007 end-page: 671 ident: bib0034 article-title: Ordonnancement dans un job-shop flexible sous contraintes de disponibilite des machines publication-title: Journal Européen Des Systèmes Automatisés – volume: 23 start-page: 665 year: 1976 end-page: 679 ident: bib0015 article-title: Open shop scheduling to minimize finish time publication-title: Journal of the ACM – volume: 9 start-page: 395 year: 1996 end-page: 416 ident: bib0020 article-title: Machine scheduling with an availability constraint publication-title: Journal of Global Optimization – year: 2002 ident: bib0002 article-title: Ordonnancement d'ateliers sous contraintes de disponibilité des machines – volume: 29 start-page: 599 year: 2001 end-page: 608 ident: bib0006 article-title: Heuristic algorithms for the two-machine flowshop with limited machine availability publication-title: Omega – volume: 25 start-page: 1400 year: 2014 end-page: 1401 ident: bib0005 article-title: One-of-a-kind production publication-title: Production Planning & Control – volume: 19 start-page: 457 year: 2014 end-page: 478 ident: bib0014 article-title: An artificial immune algorithm for multiple-route job shop scheduling problem with preventive maintenance constraints publication-title: International Journal of Operational Research – year: 2011 ident: bib0031 article-title: One-of-a-kind production – start-page: 166 year: 2003 end-page: 167 ident: bib0026 article-title: Scheduling resumable and non-resumable operationsed publication-title: Proceedings of the joint international meeting EURO/INFORMS – volume: 136 start-page: 528 year: 2002 end-page: 540 ident: bib0017 article-title: Two-machine flow shops with limited machine availability publication-title: European Journal of Operational Research – start-page: 630 year: 2013 end-page: 637 ident: bib0001 article-title: One-of-a-kind production (okp) planning and control: an empirical framework for the special purpose machines industry publication-title: Advances in production management systems. Competitive manufacturing for innovative products and services – volume: 29 start-page: 499 year: 2006 end-page: 510 ident: bib0032 article-title: Rapid one-of-a-kind production publication-title: The International Journal of Advanced Manufacturing Technology – year: 2012 ident: bib0027 article-title: Scheduling – volume: 52 start-page: 116 year: 2001 end-page: 121 ident: bib0012 article-title: Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability publication-title: Journal of the Operational Research Society – volume: 20 start-page: 129 year: 1997 end-page: 139 ident: bib0021 article-title: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint publication-title: Operations Research Letters – volume: 42 start-page: 2395 year: 2015 end-page: 2410 ident: bib0029 article-title: Metaheuristics optimization approaches for two-stage reentrant flexible flow shop with blocking constraint publication-title: Expert Systems with Applications – volume: 43 start-page: 135 year: 2011 end-page: 157 ident: bib0010 article-title: A combined integer/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions publication-title: Engineering Optimization – volume: 112 start-page: 151 year: 2008 end-page: 160 ident: bib0035 article-title: Minimizing the makespan for the mpm job-shop with availability constraints publication-title: International Journal of Production Economics – volume: 28 start-page: 616 year: 2015 end-page: 627 ident: bib0024 article-title: Due date assignment and dynamic scheduling of one-of-a-kind assembly production with uncertain processing time publication-title: International Journal of Computer Integrated Manufacturing – volume: 29 start-page: 65 year: 2001 end-page: 77 ident: bib0007 article-title: Two-machine open shop scheduling with an availability constraint publication-title: Operations Research Letters – volume: 58 start-page: 199 year: 2010 end-page: 211 ident: bib0025 article-title: A survey of scheduling with deterministic machine availability constraints publication-title: Computers & Industrial Engineering – volume: 114 start-page: 420 year: 1999 end-page: 429 ident: bib0022 article-title: Two-machine flowshop scheduling with availability constraints publication-title: European Journal of Operational Research – year: 1997 ident: bib0033 article-title: Customer-driven manufacturing – volume: 57 start-page: 217 year: 2003 end-page: 234 ident: bib0008 article-title: Non-preemptive two-machine open shop scheduling with non-availability constraints publication-title: Mathematical Methods of Operations Research – volume: 47 start-page: 1071 year: 2009 end-page: 1087 ident: bib0009 article-title: An information system for one-of-a-kind production publication-title: International Journal of Production Research – volume: 37 start-page: 497 year: 1999 end-page: 500 ident: bib0011 article-title: Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability publication-title: Computers & Industrial Engineering – volume: 38 start-page: 2020 year: 2011 end-page: 2029 ident: bib0028 article-title: A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown publication-title: Expert Systems with Applications – volume: 12 start-page: 655 year: 1964 end-page: 679 ident: bib0013 article-title: Sequencing a one state-variable machine: a solvable case of the traveling salesman problem publication-title: Operations Research – volume: 89 start-page: 172 year: 1996 end-page: 175 ident: bib0016 article-title: Preemptive scheduling in a two-stage multiprocessor flow shop is np-hard publication-title: European Journal of Operational Research – volume: 153 start-page: 534 year: 2004 end-page: 543 ident: bib0003 article-title: Minimizing the makespan for the flow shop scheduling problem with availability constraints publication-title: European Journal of Operational Research – volume: 35 start-page: 795 year: 1998 end-page: 811 ident: bib0030 article-title: Machine scheduling with availability constraints publication-title: Acta Informatica – volume: 33 start-page: 1399 year: 2006 end-page: 1419 ident: bib0004 article-title: Scheduling two-stage hybrid flow shop with availability constraints publication-title: Computers & Operations Research – year: 2004 ident: bib0023 article-title: Machine scheduling with an availability constraint publication-title: Handbook of scheduling: algorithms, models, and performance analysis – volume: 53 start-page: 16 year: 2006 end-page: 23 ident: bib0019 article-title: Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints publication-title: Naval Research Logistics – volume: 41 start-page: 651 issue: 6 year: 2007 ident: 10.1016/j.eswa.2015.08.012_bib0034 article-title: Ordonnancement dans un job-shop flexible sous contraintes de disponibilite des machines publication-title: Journal Européen Des Systèmes Automatisés doi: 10.3166/jesa.41.651-671 – volume: 53 start-page: 16 issue: 1 year: 2006 ident: 10.1016/j.eswa.2015.08.012_bib0019 article-title: Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints publication-title: Naval Research Logistics doi: 10.1002/nav.20122 – volume: 153 start-page: 534 issue: 3 year: 2004 ident: 10.1016/j.eswa.2015.08.012_bib0003 article-title: Minimizing the makespan for the flow shop scheduling problem with availability constraints publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00261-3 – volume: 20 start-page: 129 issue: 3 year: 1997 ident: 10.1016/j.eswa.2015.08.012_bib0021 article-title: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint publication-title: Operations Research Letters doi: 10.1016/S0167-6377(96)00041-7 – volume: 25 start-page: 1400 issue: 16 year: 2014 ident: 10.1016/j.eswa.2015.08.012_bib0005 article-title: One-of-a-kind production publication-title: Production Planning & Control doi: 10.1080/09537287.2013.835580 – volume: 29 start-page: 599 issue: 6 year: 2001 ident: 10.1016/j.eswa.2015.08.012_bib0006 article-title: Heuristic algorithms for the two-machine flowshop with limited machine availability publication-title: Omega doi: 10.1016/S0305-0483(01)00048-2 – volume: 29 start-page: 499 issue: 5–6 year: 2006 ident: 10.1016/j.eswa.2015.08.012_bib0032 article-title: Rapid one-of-a-kind production publication-title: The International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-005-2534-z – volume: 19 start-page: 457 issue: 4 year: 2014 ident: 10.1016/j.eswa.2015.08.012_bib0014 article-title: An artificial immune algorithm for multiple-route job shop scheduling problem with preventive maintenance constraints publication-title: International Journal of Operational Research doi: 10.1504/IJOR.2014.060414 – volume: 9 start-page: 395 issue: 3–4 year: 1996 ident: 10.1016/j.eswa.2015.08.012_bib0020 article-title: Machine scheduling with an availability constraint publication-title: Journal of Global Optimization doi: 10.1007/BF00121681 – volume: 114 start-page: 420 issue: 2 year: 1999 ident: 10.1016/j.eswa.2015.08.012_bib0022 article-title: Two-machine flowshop scheduling with availability constraints publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(97)00452-9 – volume: 38 start-page: 2020 issue: 3 year: 2011 ident: 10.1016/j.eswa.2015.08.012_bib0028 article-title: A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2010.07.138 – volume: 89 start-page: 172 issue: 1 year: 1996 ident: 10.1016/j.eswa.2015.08.012_bib0016 article-title: Preemptive scheduling in a two-stage multiprocessor flow shop is np-hard publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(96)90070-3 – volume: 112 start-page: 151 issue: 1 year: 2008 ident: 10.1016/j.eswa.2015.08.012_bib0035 article-title: Minimizing the makespan for the mpm job-shop with availability constraints publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2007.01.014 – volume: 33 start-page: 1399 issue: 5 year: 2006 ident: 10.1016/j.eswa.2015.08.012_bib0004 article-title: Scheduling two-stage hybrid flow shop with availability constraints publication-title: Computers & Operations Research doi: 10.1016/j.cor.2004.09.034 – volume: 36 start-page: 379 issue: 2 year: 2009 ident: 10.1016/j.eswa.2015.08.012_bib0018 article-title: Approximation results for flow shop scheduling problems with machine availability constraints publication-title: Computers & Operations Research doi: 10.1016/j.cor.2007.10.013 – volume: 35 start-page: 795 issue: 9 year: 1998 ident: 10.1016/j.eswa.2015.08.012_bib0030 article-title: Machine scheduling with availability constraints publication-title: Acta Informatica doi: 10.1007/s002360050143 – year: 2012 ident: 10.1016/j.eswa.2015.08.012_bib0027 – volume: 29 start-page: 65 issue: 2 year: 2001 ident: 10.1016/j.eswa.2015.08.012_bib0007 article-title: Two-machine open shop scheduling with an availability constraint publication-title: Operations Research Letters doi: 10.1016/S0167-6377(01)00079-7 – volume: 12 start-page: 655 issue: 5 year: 1964 ident: 10.1016/j.eswa.2015.08.012_bib0013 article-title: Sequencing a one state-variable machine: a solvable case of the traveling salesman problem publication-title: Operations Research doi: 10.1287/opre.12.5.655 – start-page: 166 year: 2003 ident: 10.1016/j.eswa.2015.08.012_bib0026 article-title: Scheduling resumable and non-resumable operationsed – volume: 58 start-page: 199 issue: 2 year: 2010 ident: 10.1016/j.eswa.2015.08.012_bib0025 article-title: A survey of scheduling with deterministic machine availability constraints publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2009.04.014 – year: 1997 ident: 10.1016/j.eswa.2015.08.012_bib0033 – volume: 23 start-page: 665 issue: 4 year: 1976 ident: 10.1016/j.eswa.2015.08.012_bib0015 article-title: Open shop scheduling to minimize finish time publication-title: Journal of the ACM doi: 10.1145/321978.321985 – volume: 42 start-page: 2395 issue: 5 year: 2015 ident: 10.1016/j.eswa.2015.08.012_bib0029 article-title: Metaheuristics optimization approaches for two-stage reentrant flexible flow shop with blocking constraint publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2014.10.043 – start-page: 630 year: 2013 ident: 10.1016/j.eswa.2015.08.012_bib0001 article-title: One-of-a-kind production (okp) planning and control: an empirical framework for the special purpose machines industry – volume: 57 start-page: 217 issue: 2 year: 2003 ident: 10.1016/j.eswa.2015.08.012_bib0008 article-title: Non-preemptive two-machine open shop scheduling with non-availability constraints publication-title: Mathematical Methods of Operations Research doi: 10.1007/s001860200267 – volume: 136 start-page: 528 issue: 3 year: 2002 ident: 10.1016/j.eswa.2015.08.012_bib0017 article-title: Two-machine flow shops with limited machine availability publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00083-2 – volume: 37 start-page: 497 issue: 1 year: 1999 ident: 10.1016/j.eswa.2015.08.012_bib0011 article-title: Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability publication-title: Computers & Industrial Engineering doi: 10.1016/S0360-8352(99)00127-8 – year: 2004 ident: 10.1016/j.eswa.2015.08.012_bib0023 article-title: Machine scheduling with an availability constraint – year: 2011 ident: 10.1016/j.eswa.2015.08.012_bib0031 – volume: 52 start-page: 116 issue: 1 year: 2001 ident: 10.1016/j.eswa.2015.08.012_bib0012 article-title: Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601025 – volume: 28 start-page: 616 issue: 6 year: 2015 ident: 10.1016/j.eswa.2015.08.012_bib0024 article-title: Due date assignment and dynamic scheduling of one-of-a-kind assembly production with uncertain processing time publication-title: International Journal of Computer Integrated Manufacturing doi: 10.1080/0951192X.2014.900859 – volume: 47 start-page: 1071 issue: 4 year: 2009 ident: 10.1016/j.eswa.2015.08.012_bib0009 article-title: An information system for one-of-a-kind production publication-title: International Journal of Production Research doi: 10.1080/00207540701543593 – year: 2002 ident: 10.1016/j.eswa.2015.08.012_bib0002 – volume: 43 start-page: 135 issue: 2 year: 2011 ident: 10.1016/j.eswa.2015.08.012_bib0010 article-title: A combined integer/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions publication-title: Engineering Optimization doi: 10.1080/03052151003759117 |
| SSID | ssj0017007 |
| Score | 2.2049012 |
| Snippet | •Focus on scheduling of an LP-OKP model with machines availability constraints.•Propose slack-based mixed integer linear programming scheduling... This paper addresses a job shop scheduling problem, in which the jobs belong to the large-piece one-of-a-kind production (LP-OKP) model, and the machines are... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 9174 |
| SubjectTerms | Algorithms Availability Availability constraints Central processing units Construction industry Large-piece one-of-a-kind production Mathematical models Scheduling Search methods Searching Slack-based mixed integer linear programming model Time slot-based search method |
| Title | Scheduling to minimize the makespan in large-piece one-of-a-kind production with machine availability constraints |
| URI | https://dx.doi.org/10.1016/j.eswa.2015.08.012 https://www.proquest.com/docview/1825463663 |
| Volume | 42 |
| WOSCitedRecordID | wos000362613000009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-6793 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017007 issn: 0957-4174 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLaqjgdeuCN2Q0bibTKK46SJH6dpEyA0ITGg8BI5iS2ytUlZ027jT_CXOb6lWdEm9sBL1Fq25fZ8OT5xvvMdhF6zUSq5JjiMOI1JxHJFODw1k1IWo0Ll8ABh5Iu_fEiOj9PxmH8cDH77XJjlJKnr9PKSz_6rqaENjK1TZ-9g7m5SaIDPYHS4gtnh-k-G_wRmKBcmyxziSi0dMq1-SRNgTsWZBA9iyI0TTQEns0rCjd3UkjSKCHJWGdkAIwKrcWFOaaeGbyn3xFJUEyvrfaXZ6nNTXsIqQXWH-1o5uXX60D5zrveOvCPsWI7uV1lfNYteo_U8339UebXiChnCwTfXz51QgMlpSGyOZnfUmJCI2mo83utGYQ9dIev5UO57SvfVVif6y9fbY4fTN3J-oQWkaGy0WB0p-5qw9tqG19EQPcPtNNNzZHqOTBfl1FWrN8Ik5ukQbey_Oxy_715MJYHNwPc_yeVhWcrg-kpuinXWdn0Typw8Qg_cMwjet9h5jAayfoIe-voe2Ln7p-jnCkq4bbCHEgYoYQ8lXNW4ByV8DUp4BSWsoYAdlHAfSrgHpWfo89HhycFb4kp0kIIx1pIoKMq4kLDbBpIXENyGRv8nlFQyESVKqZgLxlMqFAzQzMZISzKWMIwFpVDsORrWsLIXCIswTQvOZMmEiqJA5QGLc5XnVMsR0VhsIur_zKxw-vV6cZPsZjNuor1uzMyqt9zaO_Y2ylz8aePKDCB367hX3qAZOGf9xk3UslnMM2rLTUBUv3WnlWyj-6sbaQcN2_OF3EX3imVbzc9fOkz-AUmit4A |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Scheduling+to+minimize+the+makespan+in+large-piece+one-of-a-kind+production+with+machine+availability+constraints&rft.jtitle=Expert+systems+with+applications&rft.au=Jia%2C+Wenyou&rft.au=Jiang%2C+Zhibin&rft.au=Li%2C+You&rft.date=2015-12-15&rft.issn=0957-4174&rft.volume=42&rft.issue=23&rft.spage=9174&rft.epage=9182&rft_id=info:doi/10.1016%2Fj.eswa.2015.08.012&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_eswa_2015_08_012 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0957-4174&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0957-4174&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0957-4174&client=summon |