Modeling and scheduling no-wait open shop problems
This paper studies the problem of scheduling open shops with no intermediate buffer, called no-wait open shops under makespan minimization. No-wait scheduling problems arise in many realistic production environments such as hot metal rolling, the plastic molding, chemical and pharmaceutical, food pr...
Gespeichert in:
| Veröffentlicht in: | International journal of production economics Jg. 158; S. 256 - 266 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
Elsevier B.V
01.12.2014
Elsevier Sequoia S.A |
| Schlagworte: | |
| ISSN: | 0925-5273, 1873-7579 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This paper studies the problem of scheduling open shops with no intermediate buffer, called no-wait open shops under makespan minimization. No-wait scheduling problems arise in many realistic production environments such as hot metal rolling, the plastic molding, chemical and pharmaceutical, food processing and several other industries. To tackle such problems, we first develop three different mathematical models, mixed integer linear programs, by which we can solve the problem to optimality. Besides the models, we propose novel metaheuristics based on genetic and variable neighborhood search algorithms to solve the large-sized problems in an acceptable computational time. The key point in any scheduling solver is the procedure of encoding and decoding schemes. In this paper, we propose a simple yet effective tailor-made procedure of encoding and decoding schemes for no-wait open shop problems. The operators of the proposed metaheuristics are designed so as to consider the specific encoding scheme of the problem. To evaluate the performance of models and metaheuristics, we conduct two computational experiments. The first includes small-sized instances by which we compare the mathematical models and assess general performance of the proposed metaheuristics. In the second experiment, we further evaluate the potential of metaheuristics on solving some benchmarks in the literature of pure open shops. The results show that the models and metaheuristics are effective to deal with the no-wait open shop problems. |
|---|---|
| AbstractList | This paper studies the problem of scheduling open shops with no intermediate buffer, called no-wait open shops under makespan minimization. No-wait scheduling problems arise in many realistic production environments such as hot metal rolling, the plastic molding, chemical and pharmaceutical, food processing and several other industries. To tackle such problems, we first develop three different mathematical models, mixed integer linear programs, by which we can solve the problem to optimality. Besides the models, we propose novel metaheuristics based on genetic and variable neighborhood search algorithms to solve the large-sized problems in an acceptable computational time. The key point in any scheduling solver is the procedure of encoding and decoding schemes. In this paper, we propose a simple yet effective tailor-made procedure of encoding and decoding schemes for no-wait open shop problems. The operators of the proposed metaheuristics are designed so as to consider the specific encoding scheme of the problem. To evaluate the performance of models and metaheuristics, we conduct two computational experiments. The first includes small-sized instances by which we compare the mathematical models and assess general performance of the proposed metaheuristics. In the second experiment, we further evaluate the potential of metaheuristics on solving some benchmarks in the literature of pure open shops. The results show that the models and metaheuristics are effective to deal with the no-wait open shop problems. |
| Author | Naderi, B. Zandieh, M. |
| Author_xml | – sequence: 1 givenname: B. surname: Naderi fullname: Naderi, B. organization: Department of Industrial Engineering, Faculty of Engineering, Kharazmi University, Tehran, Iran – sequence: 2 givenname: M. surname: Zandieh fullname: Zandieh, M. email: m_zandieh@sbu.ac.ir organization: Department of Industrial Management, Accounting and Management Faculty, Shahid Beheshti University, G.C., Tehran, Iran |
| BookMark | eNp9kE1PwyAYgImZidv0D3hq4sVLK9DSlsSLWfxKZrzomVB462g6qNBq_Pcy52mHncgbngfePAs0s84CQpcEZwST8qbLTDdARjEpMlxmmJATNCd1lacVq_gMzTGnLGW0ys_QIoQOY1yRup4j-uI09MZ-JNLqJKgN6OlvtC79lmZM3AA2CRs3JIN3TQ_bcI5OW9kHuPg_l-j94f5t9ZSuXx-fV3frVBWUjWnTElVJyKFpOZdSxTWbqi5IIbku4kQbWscbSlqmeVUWvG1zDURD3eqGsDpfouv9u_HjzwnCKLYmKOh7acFNQZCSkaJgnO7QqwO0c5O3cbtI0ZyVOeUsUnRPKe9C8NCKwZut9D-CYLHLKDqxyyh2GQUuRcwYpfpAUmaUo3F29NL0x9XbvQqx0pcBL4IyYBVo40GNQjtzTP8FCZuPCQ |
| CODEN | IJPCEY |
| CitedBy_id | crossref_primary_10_1007_s00170_020_06145_5 crossref_primary_10_1007_s40819_024_01711_x crossref_primary_10_1016_j_apm_2018_11_015 crossref_primary_10_1016_j_cie_2022_108128 crossref_primary_10_1109_ACCESS_2019_2944296 crossref_primary_10_1016_j_ejor_2020_02_010 crossref_primary_10_1016_j_rcim_2021_102261 crossref_primary_10_1007_s40092_018_0297_z crossref_primary_10_1016_j_ejor_2016_05_036 crossref_primary_10_1016_j_ijpe_2015_04_005 crossref_primary_10_1016_j_cor_2023_106386 crossref_primary_10_1016_j_ejor_2021_03_026 crossref_primary_10_1016_j_jer_2024_02_019 crossref_primary_10_1155_2017_7219656 crossref_primary_10_1007_s00521_020_05055_7 crossref_primary_10_1016_j_ins_2018_04_038 crossref_primary_10_1080_00207543_2022_2154404 crossref_primary_10_1080_0305215X_2021_1957101 crossref_primary_10_1016_j_artint_2025_104405 crossref_primary_10_1016_j_cor_2024_106595 crossref_primary_10_1016_j_eswa_2023_122594 |
| Cites_doi | 10.1016/j.ijpe.2012.10.024 10.1002/(SICI)1520-6750(199903)46:2<129::AID-NAV1>3.0.CO;2-3 10.1016/j.ijpe.2007.01.005 10.1016/j.omega.2004.12.006 10.1016/S0377-2217(97)00332-9 10.1016/0305-0548(84)90016-9 10.1016/S0305-0548(97)00079-8 10.1016/j.cie.2007.01.004 10.1016/S0377-2217(99)00168-X 10.1016/j.ijpe.2012.06.017 10.1287/opre.44.3.510 10.1287/opre.8.2.219 10.1016/S0166-218X(96)00116-3 10.1057/palgrave.jors.2601805 10.1016/j.ijpe.2013.04.040 10.1016/j.cor.2003.09.005 10.1016/j.ejor.2007.02.057 10.1016/0377-2217(93)90182-M 10.1016/S0167-5060(08)70356-X 10.1016/j.mcm.2008.01.002 10.1002/nav.3800060205 10.1287/moor.4.4.448 10.1016/j.ijpe.2013.01.010 10.1007/s10845-008-0157-6 10.1016/j.future.2009.01.004 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier B.V. Copyright Elsevier Sequoia S.A. Dec 2014 |
| Copyright_xml | – notice: 2014 Elsevier B.V. – notice: Copyright Elsevier Sequoia S.A. Dec 2014 |
| DBID | AAYXX CITATION 7TA 7TB 8FD FR3 JG9 KR7 |
| DOI | 10.1016/j.ijpe.2014.06.011 |
| DatabaseName | CrossRef Materials Business File Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database Materials Research Database Civil Engineering Abstracts |
| DatabaseTitle | CrossRef Materials Research Database Civil Engineering Abstracts Engineering Research Database Technology Research Database Mechanical & Transportation Engineering Abstracts Materials Business File |
| DatabaseTitleList | Materials Research Database Materials Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Business Economics |
| EISSN | 1873-7579 |
| EndPage | 266 |
| ExternalDocumentID | 3493827091 10_1016_j_ijpe_2014_06_011 S0925527314001947 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29J 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFFL AAIAV AAIKJ AAKOC AALRI AAOAW AAPFB AAQFI AAQXK AARIN AAXUO ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACDAQ ACGFO ACGFS ACGOD ACIWK ACNNM ACRLP ACROA ADBBV ADEZE ADFHU ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AEYQN AFKWA AFODL AFTJW AGHFR AGTHC AGUBO AGYEJ AHHHB AHJVU AI. AIEXJ AIIAU AIKHN AITUG AJBFU AJOXV AJWLA ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ASPBG AVWKF AXJTR AXLSJ AZFZN BEHZQ BEZPJ BGSCR BJAXD BKOJK BKOMP BLXMC BNTGB BPUDD BULVW BZJEE CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HLX HVGLF HZ~ IHE IXIXF J1W JJJVA KOM LG8 LY1 LY7 M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SBM SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SSF SST SSZ T5K TAE TN5 U5U VH1 WUQ YK3 ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7TA 7TB 8FD AGCQF FR3 JG9 KR7 |
| ID | FETCH-LOGICAL-c425t-bf1c7ae3ebf99aac016b78414a9d4c012b28f9921f5d97649ff3de1de8fdb1583 |
| ISICitedReferencesCount | 20 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000345729500024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0925-5273 |
| IngestDate | Thu Oct 02 09:48:46 EDT 2025 Wed Aug 13 07:08:37 EDT 2025 Sat Nov 29 03:48:09 EST 2025 Tue Nov 18 21:58:58 EST 2025 Fri Feb 23 02:31:14 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | No-wait Open shop Scheduling Mixed integer linear programming Genetic algorithm Variable neighborhood search |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c425t-bf1c7ae3ebf99aac016b78414a9d4c012b28f9921f5d97649ff3de1de8fdb1583 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1623563295 |
| PQPubID | 45063 |
| PageCount | 11 |
| ParticipantIDs | proquest_miscellaneous_1651445928 proquest_journals_1623563295 crossref_primary_10_1016_j_ijpe_2014_06_011 crossref_citationtrail_10_1016_j_ijpe_2014_06_011 elsevier_sciencedirect_doi_10_1016_j_ijpe_2014_06_011 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-12-01 |
| PublicationDateYYYYMMDD | 2014-12-01 |
| PublicationDate_xml | – month: 12 year: 2014 text: 2014-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | International journal of production economics |
| PublicationYear | 2014 |
| Publisher | Elsevier B.V Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier Sequoia S.A |
| References | Brucker, Hurink, Jurisch, Wöstmann (bib5) 1997; 76 Sidney, Sriskandarajah (bib20) 1999; 46 Wagner (bib26) 1959; 6 Liaw, Cheng, Chen (bib13) 2005; 32 Yao, Soewandi (bib28) 2000; 17 Ruiz, Maroto, Alcaraz (bib24) 2006; 34 Naderi, Zandieh, Fatemi Ghomi (bib16) 2009; 20 Roshanaei, Naderi, Jolai, Khalili (bib23) 2009; 25 Graham, Lawler, Lenstra, Rinnooy Kan (bib7) 1979; 5 Liao, Cheng (bib11) 2007; 52 Manne (bib15) 1960; 8 Yao, M.J., Lai, C.W., 2002. A genetic algorithm for the two machine open shop scheduling problem with blocking. In: The Second Japanese-Sino Optimization Meeting (JSOM 2002), Kyoto, Japan, pp. 25–27. Bennell, Lee, Potts (bib3) 2013; 145 Rios-Mercado, Bard (bib22) 1998; 25 Liaw (bib12) 2000; 124 Adiri, Amit (bib1) 1984; 11 Guéret, Prins (bib9) 1998; 107 Andresen, Bräsel, Morig, Tusch, Werner, Willenius (bib2) 2008; 48 Pang (bib17) 2013; 141 Sahni, Cho (bib19) 1979; 4 Stafford Jr., Tseng, Gupta (bib21) 2005; 56 Bräsel, Herms, Morig, Tautenhahn, Tusch, Werner (bib4) 2008; 189 Divsalar, Vansteenwegen, Cattrysse (bib6) 2013; 145 Zhang, Chang, Wu (bib29) 2013; 145 Taillard (bib25) 1993; 64 Lin, Lee, Pan (bib14) 2008; 111 Pinedo (bib18) 2008 Hall, Sriskandarajah (bib10) 1996; 44 Goyal, Sriskandarajah (bib8) 1988; 25 Sahni (10.1016/j.ijpe.2014.06.011_bib19) 1979; 4 Lin (10.1016/j.ijpe.2014.06.011_bib14) 2008; 111 Hall (10.1016/j.ijpe.2014.06.011_bib10) 1996; 44 Bräsel (10.1016/j.ijpe.2014.06.011_bib4) 2008; 189 Yao (10.1016/j.ijpe.2014.06.011_bib28) 2000; 17 Pang (10.1016/j.ijpe.2014.06.011_bib17) 2013; 141 Liao (10.1016/j.ijpe.2014.06.011_bib11) 2007; 52 Graham (10.1016/j.ijpe.2014.06.011_bib7) 1979; 5 Bennell (10.1016/j.ijpe.2014.06.011_bib3) 2013; 145 Pinedo (10.1016/j.ijpe.2014.06.011_bib18) 2008 Liaw (10.1016/j.ijpe.2014.06.011_bib13) 2005; 32 Stafford Jr. (10.1016/j.ijpe.2014.06.011_bib21) 2005; 56 Rios-Mercado (10.1016/j.ijpe.2014.06.011_bib22) 1998; 25 Liaw (10.1016/j.ijpe.2014.06.011_bib12) 2000; 124 Wagner (10.1016/j.ijpe.2014.06.011_bib26) 1959; 6 Brucker (10.1016/j.ijpe.2014.06.011_bib5) 1997; 76 Roshanaei (10.1016/j.ijpe.2014.06.011_bib23) 2009; 25 Guéret (10.1016/j.ijpe.2014.06.011_bib9) 1998; 107 Goyal (10.1016/j.ijpe.2014.06.011_bib8) 1988; 25 Adiri (10.1016/j.ijpe.2014.06.011_bib1) 1984; 11 Manne (10.1016/j.ijpe.2014.06.011_bib15) 1960; 8 Ruiz (10.1016/j.ijpe.2014.06.011_bib24) 2006; 34 Sidney (10.1016/j.ijpe.2014.06.011_bib20) 1999; 46 Naderi (10.1016/j.ijpe.2014.06.011_bib16) 2009; 20 10.1016/j.ijpe.2014.06.011_bib27 Andresen (10.1016/j.ijpe.2014.06.011_bib2) 2008; 48 Taillard (10.1016/j.ijpe.2014.06.011_bib25) 1993; 64 Divsalar (10.1016/j.ijpe.2014.06.011_bib6) 2013; 145 Zhang (10.1016/j.ijpe.2014.06.011_bib29) 2013; 145 |
| References_xml | – volume: 189 start-page: 856 year: 2008 end-page: 870 ident: bib4 article-title: Heuristic constructive algorithms for open shop scheduling to minimize mean flow time publication-title: Eur. J. Oper. Res. – volume: 111 start-page: 368 year: 2008 end-page: 377 ident: bib14 article-title: Heuristics for scheduling in a no-wait open shop with movable dedicated machines publication-title: Int. J. Prod. Econ. – volume: 145 start-page: 547 year: 2013 end-page: 560 ident: bib3 article-title: A genetic algorithm for two-dimensional bin packing with due dates publication-title: Int. J. Prod. Econ. – volume: 76 start-page: 43 year: 1997 end-page: 59 ident: bib5 article-title: A branch and bound algorithm for the open-shop problem publication-title: Discret. Appl. Math. – volume: 34 start-page: 461 year: 2006 end-page: 476 ident: bib24 article-title: Two new robust genetic algorithms for the flowshop scheduling problem publication-title: Omega – volume: 25 start-page: 351 year: 1998 end-page: 366 ident: bib22 article-title: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups publication-title: Comput. Oper. Res. – volume: 48 start-page: 1279 year: 2008 end-page: 1293 ident: bib2 article-title: Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop publication-title: Math. Comput. Model. – volume: 6 start-page: 131 year: 1959 end-page: 140 ident: bib26 article-title: An integer linear programming model for machine scheduling publication-title: Naval Res. Logist. Q. – volume: 17 start-page: 537 year: 2000 end-page: 547 ident: bib28 article-title: Simple heuristics for the two machine open shop problem with blocking publication-title: J. Chin. Inst. Ind. Eng. – volume: 141 start-page: 127 year: 2013 end-page: 136 ident: bib17 article-title: A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness publication-title: Int. J. Prod. Econ. – volume: 46 start-page: 129 year: 1999 end-page: 145 ident: bib20 article-title: A heuristic for the two-machine no-wait open shop scheduling problem publication-title: Naval Res. Logist. – volume: 56 start-page: 88 year: 2005 end-page: 101 ident: bib21 article-title: Comparative evaluation of MILP flowshop models publication-title: J. Oper. Res. Soc. – volume: 4 start-page: 448 year: 1979 end-page: 457 ident: bib19 article-title: Complexity of scheduling shops with no-wait in process publication-title: Math. Oper. Res. – volume: 64 start-page: 278 year: 1993 end-page: 285 ident: bib25 article-title: Benchmarks for basic scheduling problems publication-title: Eur. J. Oper. Res. – volume: 145 start-page: 150 year: 2013 end-page: 160 ident: bib6 article-title: A variable neighborhood search method for the orienteering problem with hotel selection publication-title: Int. J. Prod. Econ. – volume: 25 start-page: 220 year: 1988 end-page: 244 ident: bib8 article-title: No-wait shop scheduling: computational complexity and approximate algorithms publication-title: Oper. Res. – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: bib7 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discret. Math. – volume: 44 start-page: 510 year: 1996 end-page: 525 ident: bib10 article-title: Survey of machine scheduling problems with blocking and no-wait in process publication-title: Oper. Res. – volume: 145 start-page: 38 year: 2013 end-page: 52 ident: bib29 article-title: A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: investigations motivated by vehicle production publication-title: Int. J. Prod. Econ. – reference: Yao, M.J., Lai, C.W., 2002. A genetic algorithm for the two machine open shop scheduling problem with blocking. In: The Second Japanese-Sino Optimization Meeting (JSOM 2002), Kyoto, Japan, pp. 25–27. – volume: 107 start-page: 306 year: 1998 end-page: 314 ident: bib9 article-title: Classical and new heuristics for the open shop problem: a computational evaluation publication-title: Eur. J. Oper. Res. – volume: 20 start-page: 683 year: 2009 end-page: 694 ident: bib16 article-title: A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling publication-title: J. Intell. Manuf. – volume: 11 start-page: 275 year: 1984 end-page: 284 ident: bib1 article-title: Open shop and flow shop scheduling to minimize sum of completion times publication-title: Comput. Oper. Res. – volume: 8 start-page: 219 year: 1960 end-page: 223 ident: bib15 article-title: On the job shop scheduling problem publication-title: Oper. Res. – volume: 124 start-page: 28 year: 2000 end-page: 42 ident: bib12 article-title: A hybrid genetic algorithm for the open shop scheduling problem publication-title: Eur. J. Oper. Res. – year: 2008 ident: bib18 article-title: Scheduling: Theory, Algorithms, and Systems – volume: 52 start-page: 404 year: 2007 end-page: 413 ident: bib11 article-title: A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date publication-title: Comput. Ind.l Eng. – volume: 25 start-page: 654 year: 2009 end-page: 661 ident: bib23 article-title: A variable neighborhood search for job shop scheduling with setup times to minimize makespan publication-title: Futur. Gener. Comput. Syst. – volume: 32 start-page: 901 year: 2005 end-page: 917 ident: bib13 article-title: Scheduling two-machine no-wait open shops to minimize makespan publication-title: Comput. Oper. Res. – volume: 25 start-page: 220 year: 1988 ident: 10.1016/j.ijpe.2014.06.011_bib8 article-title: No-wait shop scheduling: computational complexity and approximate algorithms publication-title: Oper. Res. – volume: 145 start-page: 38 issue: 1 year: 2013 ident: 10.1016/j.ijpe.2014.06.011_bib29 article-title: A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: investigations motivated by vehicle production publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2012.10.024 – volume: 46 start-page: 129 year: 1999 ident: 10.1016/j.ijpe.2014.06.011_bib20 article-title: A heuristic for the two-machine no-wait open shop scheduling problem publication-title: Naval Res. Logist. doi: 10.1002/(SICI)1520-6750(199903)46:2<129::AID-NAV1>3.0.CO;2-3 – volume: 111 start-page: 368 year: 2008 ident: 10.1016/j.ijpe.2014.06.011_bib14 article-title: Heuristics for scheduling in a no-wait open shop with movable dedicated machines publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2007.01.005 – volume: 34 start-page: 461 year: 2006 ident: 10.1016/j.ijpe.2014.06.011_bib24 article-title: Two new robust genetic algorithms for the flowshop scheduling problem publication-title: Omega doi: 10.1016/j.omega.2004.12.006 – volume: 107 start-page: 306 year: 1998 ident: 10.1016/j.ijpe.2014.06.011_bib9 article-title: Classical and new heuristics for the open shop problem: a computational evaluation publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(97)00332-9 – volume: 11 start-page: 275 year: 1984 ident: 10.1016/j.ijpe.2014.06.011_bib1 article-title: Open shop and flow shop scheduling to minimize sum of completion times publication-title: Comput. Oper. Res. doi: 10.1016/0305-0548(84)90016-9 – volume: 25 start-page: 351 year: 1998 ident: 10.1016/j.ijpe.2014.06.011_bib22 article-title: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(97)00079-8 – volume: 52 start-page: 404 year: 2007 ident: 10.1016/j.ijpe.2014.06.011_bib11 article-title: A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date publication-title: Comput. Ind.l Eng. doi: 10.1016/j.cie.2007.01.004 – volume: 124 start-page: 28 year: 2000 ident: 10.1016/j.ijpe.2014.06.011_bib12 article-title: A hybrid genetic algorithm for the open shop scheduling problem publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(99)00168-X – volume: 141 start-page: 127 issue: 1 year: 2013 ident: 10.1016/j.ijpe.2014.06.011_bib17 article-title: A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2012.06.017 – volume: 44 start-page: 510 year: 1996 ident: 10.1016/j.ijpe.2014.06.011_bib10 article-title: Survey of machine scheduling problems with blocking and no-wait in process publication-title: Oper. Res. doi: 10.1287/opre.44.3.510 – volume: 8 start-page: 219 year: 1960 ident: 10.1016/j.ijpe.2014.06.011_bib15 article-title: On the job shop scheduling problem publication-title: Oper. Res. doi: 10.1287/opre.8.2.219 – volume: 76 start-page: 43 year: 1997 ident: 10.1016/j.ijpe.2014.06.011_bib5 article-title: A branch and bound algorithm for the open-shop problem publication-title: Discret. Appl. Math. doi: 10.1016/S0166-218X(96)00116-3 – volume: 56 start-page: 88 year: 2005 ident: 10.1016/j.ijpe.2014.06.011_bib21 article-title: Comparative evaluation of MILP flowshop models publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave.jors.2601805 – ident: 10.1016/j.ijpe.2014.06.011_bib27 – volume: 145 start-page: 547 issue: 2 year: 2013 ident: 10.1016/j.ijpe.2014.06.011_bib3 article-title: A genetic algorithm for two-dimensional bin packing with due dates publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2013.04.040 – volume: 32 start-page: 901 year: 2005 ident: 10.1016/j.ijpe.2014.06.011_bib13 article-title: Scheduling two-machine no-wait open shops to minimize makespan publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2003.09.005 – year: 2008 ident: 10.1016/j.ijpe.2014.06.011_bib18 – volume: 189 start-page: 856 issue: 3 year: 2008 ident: 10.1016/j.ijpe.2014.06.011_bib4 article-title: Heuristic constructive algorithms for open shop scheduling to minimize mean flow time publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.02.057 – volume: 64 start-page: 278 year: 1993 ident: 10.1016/j.ijpe.2014.06.011_bib25 article-title: Benchmarks for basic scheduling problems publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(93)90182-M – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.ijpe.2014.06.011_bib7 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discret. Math. doi: 10.1016/S0167-5060(08)70356-X – volume: 48 start-page: 1279 issue: 7–8 year: 2008 ident: 10.1016/j.ijpe.2014.06.011_bib2 article-title: Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop publication-title: Math. Comput. Model. doi: 10.1016/j.mcm.2008.01.002 – volume: 6 start-page: 131 year: 1959 ident: 10.1016/j.ijpe.2014.06.011_bib26 article-title: An integer linear programming model for machine scheduling publication-title: Naval Res. Logist. Q. doi: 10.1002/nav.3800060205 – volume: 4 start-page: 448 year: 1979 ident: 10.1016/j.ijpe.2014.06.011_bib19 article-title: Complexity of scheduling shops with no-wait in process publication-title: Math. Oper. Res. doi: 10.1287/moor.4.4.448 – volume: 17 start-page: 537 issue: 5 year: 2000 ident: 10.1016/j.ijpe.2014.06.011_bib28 article-title: Simple heuristics for the two machine open shop problem with blocking publication-title: J. Chin. Inst. Ind. Eng. – volume: 145 start-page: 150 issue: 1 year: 2013 ident: 10.1016/j.ijpe.2014.06.011_bib6 article-title: A variable neighborhood search method for the orienteering problem with hotel selection publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2013.01.010 – volume: 20 start-page: 683 year: 2009 ident: 10.1016/j.ijpe.2014.06.011_bib16 article-title: A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling publication-title: J. Intell. Manuf. doi: 10.1007/s10845-008-0157-6 – volume: 25 start-page: 654 year: 2009 ident: 10.1016/j.ijpe.2014.06.011_bib23 article-title: A variable neighborhood search for job shop scheduling with setup times to minimize makespan publication-title: Futur. Gener. Comput. Syst. doi: 10.1016/j.future.2009.01.004 |
| SSID | ssj0007188 |
| Score | 2.2345254 |
| Snippet | This paper studies the problem of scheduling open shops with no intermediate buffer, called no-wait open shops under makespan minimization. No-wait scheduling... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 256 |
| SubjectTerms | Computation Decoding Economics Encoding Genetic algorithm Genetic algorithms Heuristic Heuristic methods Integer programming Job shops Mathematical models Mixed integer linear programming No-wait Open shop Optimization Performance evaluation Production scheduling Scheduling Studies Variable neighborhood search |
| Title | Modeling and scheduling no-wait open shop problems |
| URI | https://dx.doi.org/10.1016/j.ijpe.2014.06.011 https://www.proquest.com/docview/1623563295 https://www.proquest.com/docview/1651445928 |
| Volume | 158 |
| WOSCitedRecordID | wos000345729500024&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-7579 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007188 issn: 0925-5273 databaseCode: AIEXJ dateStart: 19950301 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwELbKhhB7QDCY6BgoSIiXKFPtxI39WKFOgKaCtE6qeLEcx9FaVUm2tmN_PufYTn8gKnjgJUriJEp8l7vP9t13CH1gPJUScGrUS7mCAYrqR5xJEIjqpUoVvE-1bIpNpKMRm0z4906n8Lkw9_O0LNnDA6__q6jhHAjbpM7-g7jbh8IJ2AehwxbEDtu_Erypbjb3qYcwdgVf0hyWVfRTTpehqZcVLm6qOnTFZBabAHV7hnCDV6K21LBGW7RLZm7h-MiEQzdhAe0Czg-TLqNv1vOtbmYBJztRGm3Ky5W-XVVTGV6dDzbnDwmNDHubdSTWerI0jlJqq8O05tVSs3sDaWnEfzPcdg5hdj6d1Ya8FCcNq6qzw1ss2aNv4uL68lKMh5PxdqvzyjxmJAUY9LG-jUx1MbMK70qtPEKHJKUcDPjh4Mtw8rX12eChG5_tP8qlV9lIwN13-hOE2XHmDUIZP0fP3NAiGFiVeIE6ujxGT3xmwzE62uCefImI15MAJBWs9SRwehIYPQmMngReT16h64vh-NPnyBXQiBSY4mWUFVilUsc6KziXUsHnZGadOZE8T-CIZIRBC8EFzQGWJrwo4lzjXLMiz0Bu8Qk6KKtSv0ZBxqFVMZ7hJE9IlvAe1axHJQM8Sous30XY94lQjl3eFDmZCx9GOBOmH4XpR2FiKTHuorC9p7bcKnuvpr6rhUOHFvUJ0KG99515uQj31ywEBtRP-zHhtIvet81gWc1ymSx1tTLXwGAioZyw0_2PeIOern-fM3SwvFvpt-ixul9OF3fvnKr9AjKWl3Y |
| 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=Modeling+and+scheduling+no-wait+open+shop+problems&rft.jtitle=International+journal+of+production+economics&rft.au=Naderi%2C+B&rft.au=Zandieh%2C+M&rft.date=2014-12-01&rft.pub=Elsevier+Sequoia+S.A&rft.issn=0925-5273&rft.eissn=1873-7579&rft.volume=158&rft.spage=256&rft_id=info:doi/10.1016%2Fj.ijpe.2014.06.011&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3493827091 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5273&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5273&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5273&client=summon |