Outsourcing and rescheduling for a two-machine flow shop with the disruption of new arriving jobs: A hybrid variable neighborhood search algorithm
•The two-machine flow shop outsourcing and rescheduling problem against the disruption of new arriving jobs is addressed.•A hybrid variable neighborhood search (HVNS) algorithm is developed for solving this problem.•Two constructive heuristics are designed to generate the initial solutions for the H...
Uložené v:
| Vydané v: | Computers & industrial engineering Ročník 130; s. 198 - 221 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.04.2019
|
| Predmet: | |
| ISSN: | 0360-8352, 1879-0550 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •The two-machine flow shop outsourcing and rescheduling problem against the disruption of new arriving jobs is addressed.•A hybrid variable neighborhood search (HVNS) algorithm is developed for solving this problem.•Two constructive heuristics are designed to generate the initial solutions for the HVNS.•Extensive computational results and comparisons confirm the effectiveness of the calibrated HVNS.
This paper addresses the two-machine flow shop outsourcing and rescheduling problem (TFSORP) in response to an unexpected arrival of new jobs, in which each job can be processed in the in-house shop or outsourced to a single subcontractor. An efficient schedule is constructed for the in-house jobs, and its performance is measured by the makespan. Each of the outsourced jobs requires paying an outsourcing cost. The objective is to minimize the sum of the in-house makespan and total outsourcing cost, subject to a limit on the number of original jobs processed by the subcontractor after disruption. To solve this NP-hard problem, a mixed integer programming formulation and helpful optimization properties are first established, and then a hybrid variable neighborhood search algorithm (HVNS) that incorporates one-dimensional array representation and three problem-specific neighborhood structures is developed. At the initialization stage, either of two well-designed constructive heuristics, i.e., job addition heuristic (JAH) and job removal heuristic (JRH) is employed. At the iterative search stage, an adaptive best-improvement procedure based on three neighborhood structures is devised to play the role of local search. An extensive experimental calibration for main factors in HVNS is carried out by a full-factorial design of experiments. To validate the calibrated HVNS, computational experiments are conducted upon the test suite of various instances. As demonstrated in the results, the calibrated HVNS gains the advantage over both the commercial optimizer and exhaustive approach in terms of computation time for small-sized instances, while it also outperforms an existing meta-heuristic algorithm and two canonical ones (based on the principles of genetic algorithm and simulated annealing) in the optimizing capability. |
|---|---|
| AbstractList | •The two-machine flow shop outsourcing and rescheduling problem against the disruption of new arriving jobs is addressed.•A hybrid variable neighborhood search (HVNS) algorithm is developed for solving this problem.•Two constructive heuristics are designed to generate the initial solutions for the HVNS.•Extensive computational results and comparisons confirm the effectiveness of the calibrated HVNS.
This paper addresses the two-machine flow shop outsourcing and rescheduling problem (TFSORP) in response to an unexpected arrival of new jobs, in which each job can be processed in the in-house shop or outsourced to a single subcontractor. An efficient schedule is constructed for the in-house jobs, and its performance is measured by the makespan. Each of the outsourced jobs requires paying an outsourcing cost. The objective is to minimize the sum of the in-house makespan and total outsourcing cost, subject to a limit on the number of original jobs processed by the subcontractor after disruption. To solve this NP-hard problem, a mixed integer programming formulation and helpful optimization properties are first established, and then a hybrid variable neighborhood search algorithm (HVNS) that incorporates one-dimensional array representation and three problem-specific neighborhood structures is developed. At the initialization stage, either of two well-designed constructive heuristics, i.e., job addition heuristic (JAH) and job removal heuristic (JRH) is employed. At the iterative search stage, an adaptive best-improvement procedure based on three neighborhood structures is devised to play the role of local search. An extensive experimental calibration for main factors in HVNS is carried out by a full-factorial design of experiments. To validate the calibrated HVNS, computational experiments are conducted upon the test suite of various instances. As demonstrated in the results, the calibrated HVNS gains the advantage over both the commercial optimizer and exhaustive approach in terms of computation time for small-sized instances, while it also outperforms an existing meta-heuristic algorithm and two canonical ones (based on the principles of genetic algorithm and simulated annealing) in the optimizing capability. |
| Author | Liu, Le |
| Author_xml | – sequence: 1 givenname: Le surname: Liu fullname: Liu, Le email: sm_liul@ujn.edu.cn organization: Business School, University of Jinan, Jinan 250022, People’s Republic of China |
| BookMark | eNp9kMFqGzEURUVJIU7aD8hOPzDTp5Fla9pVCG1TCGTTroVGerJkxiPzJNvkN_rFnSFdZZHVg8c9F-65YVdTnpCxOwGtALH5sm9dwrYD0bfQtSDUB7YSets3oBRcsRXIDTRaqu6a3ZSyB4C16sWK_X0-1ZJP5NK043bynLC4iP40Lo-QiVteL7k5WBfThDyM-cJLzEd-STXyGpH7VOh0rClPPAc-4YVbonRe-H0eyld-z-PLQMnzs6VkhxHnUNrFIVPM2fOCllzkdtxlmjsPn9jHYMeCn__fW_bnx_ffD4_N0_PPXw_3T42TCmpje_QSpFVaDE4ppdd9wDUMKL32ahBy0JugrQbX-xD81nZbkN5qb8Nay00nb5l47XWUSyEM5kjpYOnFCDCLVLM3s1SzSDXQmVnqzGzfMC5Vu2yvZNP4LvntlcR50jkhmTJHJoc-EbpqfE7v0P8A1iqXwg |
| CitedBy_id | crossref_primary_10_1016_j_ijpe_2024_109163 crossref_primary_10_1080_0305215X_2024_2366486 crossref_primary_10_3233_JIFS_224624 crossref_primary_10_3389_fmech_2021_646507 crossref_primary_10_1016_j_cie_2022_108387 crossref_primary_10_1016_j_eswa_2024_123983 crossref_primary_10_1007_s11518_021_5490_8 crossref_primary_10_1016_j_cie_2023_109317 crossref_primary_10_1016_j_cirpj_2025_04_006 crossref_primary_10_1016_j_ijpe_2020_107669 crossref_primary_10_1007_s11424_024_3284_z crossref_primary_10_1016_j_cor_2022_105815 crossref_primary_10_1016_j_eswa_2022_118711 crossref_primary_10_1016_j_cor_2024_106757 crossref_primary_10_1016_j_cie_2020_106527 crossref_primary_10_1080_00207543_2023_2245919 crossref_primary_10_1080_00207543_2020_1766721 crossref_primary_10_1080_01605682_2023_2197000 crossref_primary_10_1016_j_jclepro_2024_142916 crossref_primary_10_1007_s00170_021_08104_0 crossref_primary_10_1016_j_cie_2023_109420 crossref_primary_10_1109_TASE_2021_3115821 crossref_primary_10_1016_j_cie_2025_111517 crossref_primary_10_1016_j_eswa_2025_128167 |
| Cites_doi | 10.1016/j.ejor.2011.03.037 10.1007/s10845-013-0811-5 10.1016/j.jmsy.2011.02.004 10.1016/j.ins.2012.11.007 10.1080/00207543.2013.855338 10.1287/opre.1030.0101 10.1080/07408170801975057 10.1016/S0305-0548(97)00031-2 10.1080/00207543.2011.627687 10.1016/j.cie.2014.11.024 10.1016/j.endm.2012.10.015 10.1515/jisys-2016-0016 10.1287/ijoc.1060.0209 10.1080/00207549308956824 10.1016/j.ejor.2007.02.015 10.1080/0305215X.2017.1325483 10.1007/s13675-016-0075-x 10.1287/msom.1070.0152 10.1016/j.cor.2010.11.010 10.1002/nav.3800010110 10.1023/A:1022235519958 10.1007/s10951-008-0090-8 10.1007/s10845-010-0464-6 10.1016/S0167-5060(08)70356-X 10.1080/00207543.2013.848488 10.1109/TASE.2006.887159 10.1109/4235.585893 10.1142/S0217595914500286 10.1016/j.ijpe.2010.08.011 10.1016/j.jcde.2016.08.001 10.1007/s11518-009-5094-1 10.1016/j.cor.2011.08.022 10.1080/00207543.2014.899719 10.1007/s10878-011-9442-y 10.1016/j.ejor.2011.03.017 10.1016/j.ejor.2015.12.046 10.1016/j.cie.2010.07.001 10.1016/j.ejor.2012.10.048 10.1016/j.ijpe.2007.02.036 10.1080/00207543.2015.1088970 10.1016/j.asoc.2014.07.005 10.1016/j.cor.2012.12.003 |
| ContentType | Journal Article |
| Copyright | 2019 Elsevier Ltd |
| Copyright_xml | – notice: 2019 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cie.2019.02.015 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Engineering |
| EISSN | 1879-0550 |
| EndPage | 221 |
| ExternalDocumentID | 10_1016_j_cie_2019_02_015 S0360835219300890 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKG AABNK AACTN AAEDT AAEDW AAFWJ AAIAV AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AARIN AAXUO ABAOU ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ADBBV ADEZE ADGUI ADMUD ADRHT ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LX9 LY1 LY7 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SST SSW SSZ T5K TAE TN5 WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c350t-a9ed303a581bc555849fe40be3d8d5b13b86f8a80c9dffd7a2703da8daf483623 |
| ISICitedReferencesCount | 28 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000466825100015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0360-8352 |
| IngestDate | Sat Nov 29 07:20:35 EST 2025 Tue Nov 18 22:28:08 EST 2025 Fri Feb 23 02:29:10 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Rescheduling Outsourcing Variable neighborhood search Two-machine flow shop |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c350t-a9ed303a581bc555849fe40be3d8d5b13b86f8a80c9dffd7a2703da8daf483623 |
| PageCount | 24 |
| ParticipantIDs | crossref_primary_10_1016_j_cie_2019_02_015 crossref_citationtrail_10_1016_j_cie_2019_02_015 elsevier_sciencedirect_doi_10_1016_j_cie_2019_02_015 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-04-01 |
| PublicationDateYYYYMMDD | 2019-04-01 |
| PublicationDate_xml | – month: 04 year: 2019 text: 2019-04-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Computers & industrial engineering |
| PublicationYear | 2019 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Dolgui, Proth (b0060) 2013; 51 Bo, Zhang, Pan (b0020) 2015; 24 Rocha, Gomez, Mateus, Pardalos (b0210) 2007; 18 Mladenovic, Hansen (b0160) 1997; 24 Liu, Zhou (b0150) 2013; 226 Chen, Tang (b0035) 2014; 43 Chen, Li (b0030) 2008; 40 Choi, Chung (b0040) 2011; 213 M’Hallah (b0155) 2014; 52 Yazdani, Khalili, Babagolzadeh, Jolai (b0225) 2017; 4 Lee, Choi (b0105) 2011; 213 Hall, Liu, Potts (b0080) 2007; 19 Qi (b0200) 2009; 18 Qi (b0205) 2011; 129 Vieira, Herrmann, Lin (b0215) 2003; 6 Bukchin, Hanany (b0025) 2007; 9 Lei, Guo (b0125) 2016; 54 Kirlik, Oguz (b0100) 2012; 39 Mokhtari, Abadi, Amin-Naseri (b0175) 2012; 50 Johnson (b0095) 1954; 1 Mokhtari (b0165) 2016; 31 Qi (b0195) 2008; 5 Li, Pan, Wang (b0130) 2014; 24 Choi, Chung (b0045) 2016; 252 Hall, Potts (b0085) 2004; 52 Graham, Lawler, Lenstra, Kan (b0070) 1979; 5 Bagheri, Zandieh (b0010) 2011; 30 Wolpert, Macready (b0220) 1997; 1 Neto, Godinho Filho (b0180) 2011; 38 Lee, Sung (b0110) 2008; 111 Lee, Sung (b0115) 2008; 186 Lei (b0120) 2015; 80 Ouelhadj, Petrovic (b0190) 2009; 12 Hansen, Mladenovic, Todosijevic, Hanafi (b0090) 2017; 5 Zhong, Huo (b0235) 2013; 26 Bilyk, Monch (b0015) 2012; 23 Li, Shyu, Adiga (b0135) 1993; 31 Ahmadizar, Amiri (b0005) 2018; 50 Driessel, Monch (b0065) 2011; 61 Liu, Zhou (b0145) 2012; 39 Zar (b0230) 1999 Liu, Yi, Wen, Song (b0140) 2017; 26 Chung, Choi (b0055) 2013; 226 Guo, Lei (b0075) 2014; 52 Neto, Godinho Filho, Da Silva (b0185) 2015; 20 Choi, Park (b0050) 2014; 31 Mokhtari, Abadi (b0170) 2013; 40 Ahmadizar (10.1016/j.cie.2019.02.015_b0005) 2018; 50 Hall (10.1016/j.cie.2019.02.015_b0085) 2004; 52 Qi (10.1016/j.cie.2019.02.015_b0195) 2008; 5 Qi (10.1016/j.cie.2019.02.015_b0205) 2011; 129 Bukchin (10.1016/j.cie.2019.02.015_b0025) 2007; 9 Lei (10.1016/j.cie.2019.02.015_b0120) 2015; 80 Ouelhadj (10.1016/j.cie.2019.02.015_b0190) 2009; 12 Wolpert (10.1016/j.cie.2019.02.015_b0220) 1997; 1 Lee (10.1016/j.cie.2019.02.015_b0105) 2011; 213 Bilyk (10.1016/j.cie.2019.02.015_b0015) 2012; 23 Chen (10.1016/j.cie.2019.02.015_b0030) 2008; 40 Choi (10.1016/j.cie.2019.02.015_b0050) 2014; 31 Mokhtari (10.1016/j.cie.2019.02.015_b0175) 2012; 50 Hansen (10.1016/j.cie.2019.02.015_b0090) 2017; 5 Mokhtari (10.1016/j.cie.2019.02.015_b0165) 2016; 31 Choi (10.1016/j.cie.2019.02.015_b0040) 2011; 213 Neto (10.1016/j.cie.2019.02.015_b0180) 2011; 38 Yazdani (10.1016/j.cie.2019.02.015_b0225) 2017; 4 Dolgui (10.1016/j.cie.2019.02.015_b0060) 2013; 51 Guo (10.1016/j.cie.2019.02.015_b0075) 2014; 52 Zhong (10.1016/j.cie.2019.02.015_b0235) 2013; 26 Kirlik (10.1016/j.cie.2019.02.015_b0100) 2012; 39 Li (10.1016/j.cie.2019.02.015_b0135) 1993; 31 Lee (10.1016/j.cie.2019.02.015_b0110) 2008; 111 Mokhtari (10.1016/j.cie.2019.02.015_b0170) 2013; 40 Zar (10.1016/j.cie.2019.02.015_b0230) 1999 Chen (10.1016/j.cie.2019.02.015_b0035) 2014; 43 Lee (10.1016/j.cie.2019.02.015_b0115) 2008; 186 Li (10.1016/j.cie.2019.02.015_b0130) 2014; 24 Neto (10.1016/j.cie.2019.02.015_b0185) 2015; 20 Choi (10.1016/j.cie.2019.02.015_b0045) 2016; 252 Liu (10.1016/j.cie.2019.02.015_b0140) 2017; 26 Chung (10.1016/j.cie.2019.02.015_b0055) 2013; 226 Hall (10.1016/j.cie.2019.02.015_b0080) 2007; 19 Bagheri (10.1016/j.cie.2019.02.015_b0010) 2011; 30 Vieira (10.1016/j.cie.2019.02.015_b0215) 2003; 6 Liu (10.1016/j.cie.2019.02.015_b0150) 2013; 226 Qi (10.1016/j.cie.2019.02.015_b0200) 2009; 18 Johnson (10.1016/j.cie.2019.02.015_b0095) 1954; 1 Liu (10.1016/j.cie.2019.02.015_b0145) 2012; 39 Driessel (10.1016/j.cie.2019.02.015_b0065) 2011; 61 Bo (10.1016/j.cie.2019.02.015_b0020) 2015; 24 M’Hallah (10.1016/j.cie.2019.02.015_b0155) 2014; 52 Graham (10.1016/j.cie.2019.02.015_b0070) 1979; 5 Mladenovic (10.1016/j.cie.2019.02.015_b0160) 1997; 24 Rocha (10.1016/j.cie.2019.02.015_b0210) 2007; 18 Lei (10.1016/j.cie.2019.02.015_b0125) 2016; 54 |
| References_xml | – volume: 40 start-page: 1234 year: 2013 end-page: 1242 ident: b0170 article-title: Scheduling with an outsourcing option on both manufacturer and subcontractors publication-title: Computers & Operations Research – volume: 38 start-page: 1286 year: 2011 end-page: 1293 ident: b0180 article-title: An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed publication-title: Computers & Operations Research – volume: 213 start-page: 66 year: 2011 end-page: 72 ident: b0040 article-title: Two-machine flow shop scheduling problem with an outsourcing option publication-title: European Journal of Operational Research – volume: 52 start-page: 440 year: 2004 end-page: 453 ident: b0085 article-title: Rescheduling for new orders publication-title: Operations Research – volume: 1 start-page: 61 year: 1954 end-page: 68 ident: b0095 article-title: Optimal two- and three-stage production schedules with setup times included publication-title: Naval Research Logistics Quarterly – volume: 111 start-page: 623 year: 2008 end-page: 634 ident: b0110 article-title: Single machine scheduling with outsourcing allowed publication-title: International Journal of Production Economics – volume: 26 start-page: 683 year: 2017 end-page: 695 ident: b0140 article-title: Disruption management for predictable new job arrivals in cloud manufacturing publication-title: Journal of Intelligent Systems – volume: 24 start-page: 63 year: 2014 end-page: 77 ident: b0130 article-title: A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem publication-title: Applied Soft Computing – volume: 213 start-page: 489 year: 2011 end-page: 497 ident: b0105 article-title: Two-stage production scheduling with an outsourcing option publication-title: European Journal of Operational Research – volume: 52 start-page: 3832 year: 2014 end-page: 3841 ident: b0075 article-title: Bi-objective job shop scheduling with outsourcing options publication-title: International Journal of Production Research – volume: 12 start-page: 417 year: 2009 end-page: 431 ident: b0190 article-title: A survey of dynamic scheduling in manufacturing systems publication-title: Journal of Scheduling – volume: 50 start-page: 483 year: 2018 end-page: 498 ident: b0005 article-title: Outsourcing and scheduling for a two-machine flow shop with release times publication-title: Engineering Optimization – volume: 5 start-page: 188 year: 2008 end-page: 192 ident: b0195 article-title: Coordinated logistics scheduling for in-house production and outsourcing publication-title: IEEE Transactions on Automation Science and Engineering – volume: 6 start-page: 39 year: 2003 end-page: 62 ident: b0215 article-title: Rescheduling manufacturing systems: A framework of strategies, policies, and methods publication-title: Journal of Scheduling – volume: 54 start-page: 4793 year: 2016 end-page: 4804 ident: b0125 article-title: A shuffled frog-leaping algorithm for job shop scheduling with outsourcing options publication-title: International Journal of Production Research – volume: 40 start-page: 1171 year: 2008 end-page: 1184 ident: b0030 article-title: Scheduling with subcontracting options publication-title: IIE Transactions – volume: 226 start-page: 46 year: 2013 end-page: 52 ident: b0055 article-title: Outsourcing and scheduling for two-machine ordered flow shop scheduling problems publication-title: European Journal of Operational Research – volume: 9 start-page: 263 year: 2007 end-page: 275 ident: b0025 article-title: Decentralization cost in scheduling: A game-theoretic approach publication-title: Manufacturing and Service Operations Management – volume: 24 start-page: 1097 year: 1997 end-page: 1100 ident: b0160 article-title: Variable neighborhood search publication-title: Computers & Operations Research – volume: 31 start-page: 1815 year: 1993 end-page: 1826 ident: b0135 article-title: A heuristic rescheduling algorithm for computer-based production scheduling systems publication-title: International Journal of Production Research – volume: 5 start-page: 423 year: 2017 end-page: 454 ident: b0090 article-title: Variable neighborhood search: Basics and variants publication-title: EURO Journal on Computational Optimization – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: b0070 article-title: Optimization and approximation in deterministic machine scheduling: A survey publication-title: Annals of Discrete Mathematics – volume: 80 start-page: 125 year: 2015 end-page: 131 ident: b0120 article-title: Variable neighborhood search for two-agent flow shop scheduling problem publication-title: Computers & Industrial Engineering – volume: 24 start-page: 485 year: 2015 end-page: 495 ident: b0020 article-title: A disruption recovery model for no-wait flow shop with outsourcing option publication-title: Journal of Systems and Management – volume: 31 start-page: 487 year: 2016 end-page: 501 ident: b0165 article-title: Manufacturing operations outsourcing through an artificial team process algorithm publication-title: Journal of Intelligent and Fuzzy Systems – volume: 26 start-page: 489 year: 2013 end-page: 498 ident: b0235 article-title: Single machine scheduling problems with subcontracting options publication-title: Journal of Combinatorial Optimization – volume: 43 start-page: 887 year: 2014 end-page: 894 ident: b0035 article-title: Two-machine open-shop scheduling with outsourcing publication-title: Advances in Mathematics (China) – volume: 31 start-page: 1450028 year: 2014 ident: b0050 article-title: Outsourcing decisions in publication-title: Asia-Pacific Journal of Operational Research – volume: 18 start-page: 1 year: 2009 end-page: 15 ident: b0200 article-title: Two-stage production scheduling with an option of outsourcing from a remote supplier publication-title: Journal of Systems Science and Systems Engineering – volume: 61 start-page: 336 year: 2011 end-page: 345 ident: b0065 article-title: Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times publication-title: Computers & Industrial Engineering – volume: 1 start-page: 67 year: 1997 end-page: 82 ident: b0220 article-title: No free lunch theorems for optimization publication-title: IEEE Transactions on Evolutionary Computation – year: 1999 ident: b0230 article-title: Biostatistical analysis – volume: 18 start-page: 101 year: 2007 end-page: 105 ident: b0210 article-title: Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighborhood search publication-title: IMA Journal of Management Mathematics – volume: 23 start-page: 1621 year: 2012 end-page: 1635 ident: b0015 article-title: A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines publication-title: Journal of Intelligent Manufacturing – volume: 39 start-page: 1506 year: 2012 end-page: 1520 ident: b0100 article-title: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine publication-title: Computers & Operations Research – volume: 252 start-page: 367 year: 2016 end-page: 375 ident: b0045 article-title: Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty publication-title: European Journal of Operational Research – volume: 52 start-page: 3802 year: 2014 end-page: 3819 ident: b0155 article-title: An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop publication-title: International Journal of Production Research – volume: 50 start-page: 5372 year: 2012 end-page: 5395 ident: b0175 article-title: Production scheduling with outsourcing scenarios: A mixed integer programming and efficient solution procedure publication-title: International Journal of Production Research – volume: 129 start-page: 43 year: 2011 end-page: 50 ident: b0205 article-title: Outsourcing and production scheduling for a two-stage flow shop publication-title: International Journal of Production Economics – volume: 51 start-page: 6769 year: 2013 end-page: 6777 ident: b0060 article-title: Outsourcing: Definitions and analysis publication-title: International Journal of Production Research – volume: 186 start-page: 931 year: 2008 end-page: 952 ident: b0115 article-title: Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed publication-title: European Journal of Operational Research – volume: 39 start-page: 107 year: 2012 end-page: 114 ident: b0145 article-title: Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem publication-title: Electronic Notes in Discrete Mathematics – volume: 20 start-page: 527 year: 2015 end-page: 538 ident: b0185 article-title: An ant colony optimization approach for the parallel machine scheduling problem with outsourcing allowed publication-title: Journal of Intelligent Manufacturing – volume: 30 start-page: 8 year: 2011 end-page: 15 ident: b0010 article-title: Bi-criteria flexible job-shop scheduling with sequence-dependent setup times−Variable neighborhood search approach publication-title: Journal of Manufacturing Systems – volume: 19 start-page: 633 year: 2007 end-page: 645 ident: b0080 article-title: Rescheduling for multiple new orders publication-title: INFORMS Journal on Computing – volume: 4 start-page: 46 year: 2017 end-page: 59 ident: b0225 article-title: A single-machine scheduling problem with multiple unavailability constraints: A mathematical model and an enhanced variable neighborhood search approach publication-title: Journal of Computational Design and Engineering – volume: 226 start-page: 68 year: 2013 end-page: 92 ident: b0150 article-title: Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem publication-title: Information Sciences – volume: 24 start-page: 485 issue: 4 year: 2015 ident: 10.1016/j.cie.2019.02.015_b0020 article-title: A disruption recovery model for no-wait flow shop with outsourcing option publication-title: Journal of Systems and Management – volume: 213 start-page: 489 issue: 3 year: 2011 ident: 10.1016/j.cie.2019.02.015_b0105 article-title: Two-stage production scheduling with an outsourcing option publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2011.03.037 – volume: 20 start-page: 527 issue: 3 year: 2015 ident: 10.1016/j.cie.2019.02.015_b0185 article-title: An ant colony optimization approach for the parallel machine scheduling problem with outsourcing allowed publication-title: Journal of Intelligent Manufacturing doi: 10.1007/s10845-013-0811-5 – volume: 30 start-page: 8 issue: 1 year: 2011 ident: 10.1016/j.cie.2019.02.015_b0010 article-title: Bi-criteria flexible job-shop scheduling with sequence-dependent setup times−Variable neighborhood search approach publication-title: Journal of Manufacturing Systems doi: 10.1016/j.jmsy.2011.02.004 – volume: 226 start-page: 68 year: 2013 ident: 10.1016/j.cie.2019.02.015_b0150 article-title: Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem publication-title: Information Sciences doi: 10.1016/j.ins.2012.11.007 – volume: 51 start-page: 6769 issue: 23–24 year: 2013 ident: 10.1016/j.cie.2019.02.015_b0060 article-title: Outsourcing: Definitions and analysis publication-title: International Journal of Production Research doi: 10.1080/00207543.2013.855338 – volume: 52 start-page: 440 issue: 3 year: 2004 ident: 10.1016/j.cie.2019.02.015_b0085 article-title: Rescheduling for new orders publication-title: Operations Research doi: 10.1287/opre.1030.0101 – volume: 40 start-page: 1171 issue: 12 year: 2008 ident: 10.1016/j.cie.2019.02.015_b0030 article-title: Scheduling with subcontracting options publication-title: IIE Transactions doi: 10.1080/07408170801975057 – volume: 24 start-page: 1097 issue: 11 year: 1997 ident: 10.1016/j.cie.2019.02.015_b0160 article-title: Variable neighborhood search publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(97)00031-2 – volume: 50 start-page: 5372 issue: 19 year: 2012 ident: 10.1016/j.cie.2019.02.015_b0175 article-title: Production scheduling with outsourcing scenarios: A mixed integer programming and efficient solution procedure publication-title: International Journal of Production Research doi: 10.1080/00207543.2011.627687 – year: 1999 ident: 10.1016/j.cie.2019.02.015_b0230 – volume: 80 start-page: 125 year: 2015 ident: 10.1016/j.cie.2019.02.015_b0120 article-title: Variable neighborhood search for two-agent flow shop scheduling problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2014.11.024 – volume: 39 start-page: 107 year: 2012 ident: 10.1016/j.cie.2019.02.015_b0145 article-title: Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem publication-title: Electronic Notes in Discrete Mathematics doi: 10.1016/j.endm.2012.10.015 – volume: 26 start-page: 683 issue: 4 year: 2017 ident: 10.1016/j.cie.2019.02.015_b0140 article-title: Disruption management for predictable new job arrivals in cloud manufacturing publication-title: Journal of Intelligent Systems doi: 10.1515/jisys-2016-0016 – volume: 19 start-page: 633 issue: 4 year: 2007 ident: 10.1016/j.cie.2019.02.015_b0080 article-title: Rescheduling for multiple new orders publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.1060.0209 – volume: 43 start-page: 887 issue: 6 year: 2014 ident: 10.1016/j.cie.2019.02.015_b0035 article-title: Two-machine open-shop scheduling with outsourcing publication-title: Advances in Mathematics (China) – volume: 31 start-page: 1815 issue: 8 year: 1993 ident: 10.1016/j.cie.2019.02.015_b0135 article-title: A heuristic rescheduling algorithm for computer-based production scheduling systems publication-title: International Journal of Production Research doi: 10.1080/00207549308956824 – volume: 18 start-page: 101 issue: 2 year: 2007 ident: 10.1016/j.cie.2019.02.015_b0210 article-title: Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighborhood search publication-title: IMA Journal of Management Mathematics – volume: 186 start-page: 931 issue: 3 year: 2008 ident: 10.1016/j.cie.2019.02.015_b0115 article-title: Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.02.015 – volume: 50 start-page: 483 issue: 3 year: 2018 ident: 10.1016/j.cie.2019.02.015_b0005 article-title: Outsourcing and scheduling for a two-machine flow shop with release times publication-title: Engineering Optimization doi: 10.1080/0305215X.2017.1325483 – volume: 5 start-page: 423 issue: 3 year: 2017 ident: 10.1016/j.cie.2019.02.015_b0090 article-title: Variable neighborhood search: Basics and variants publication-title: EURO Journal on Computational Optimization doi: 10.1007/s13675-016-0075-x – volume: 9 start-page: 263 issue: 3 year: 2007 ident: 10.1016/j.cie.2019.02.015_b0025 article-title: Decentralization cost in scheduling: A game-theoretic approach publication-title: Manufacturing and Service Operations Management doi: 10.1287/msom.1070.0152 – volume: 38 start-page: 1286 issue: 9 year: 2011 ident: 10.1016/j.cie.2019.02.015_b0180 article-title: An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed publication-title: Computers & Operations Research doi: 10.1016/j.cor.2010.11.010 – volume: 1 start-page: 61 issue: 1 year: 1954 ident: 10.1016/j.cie.2019.02.015_b0095 article-title: Optimal two- and three-stage production schedules with setup times included publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800010110 – volume: 6 start-page: 39 issue: 1 year: 2003 ident: 10.1016/j.cie.2019.02.015_b0215 article-title: Rescheduling manufacturing systems: A framework of strategies, policies, and methods publication-title: Journal of Scheduling doi: 10.1023/A:1022235519958 – volume: 12 start-page: 417 issue: 4 year: 2009 ident: 10.1016/j.cie.2019.02.015_b0190 article-title: A survey of dynamic scheduling in manufacturing systems publication-title: Journal of Scheduling doi: 10.1007/s10951-008-0090-8 – volume: 23 start-page: 1621 issue: 5 year: 2012 ident: 10.1016/j.cie.2019.02.015_b0015 article-title: A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines publication-title: Journal of Intelligent Manufacturing doi: 10.1007/s10845-010-0464-6 – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.cie.2019.02.015_b0070 article-title: Optimization and approximation in deterministic machine scheduling: A survey publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70356-X – volume: 52 start-page: 3832 issue: 13 year: 2014 ident: 10.1016/j.cie.2019.02.015_b0075 article-title: Bi-objective job shop scheduling with outsourcing options publication-title: International Journal of Production Research doi: 10.1080/00207543.2013.848488 – volume: 5 start-page: 188 issue: 1 year: 2008 ident: 10.1016/j.cie.2019.02.015_b0195 article-title: Coordinated logistics scheduling for in-house production and outsourcing publication-title: IEEE Transactions on Automation Science and Engineering doi: 10.1109/TASE.2006.887159 – volume: 1 start-page: 67 issue: 1 year: 1997 ident: 10.1016/j.cie.2019.02.015_b0220 article-title: No free lunch theorems for optimization publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.585893 – volume: 31 start-page: 1450028 issue: 4 year: 2014 ident: 10.1016/j.cie.2019.02.015_b0050 article-title: Outsourcing decisions in m-machine permutation flow shop scheduling problems with machine-dependent processing times publication-title: Asia-Pacific Journal of Operational Research doi: 10.1142/S0217595914500286 – volume: 129 start-page: 43 issue: 1 year: 2011 ident: 10.1016/j.cie.2019.02.015_b0205 article-title: Outsourcing and production scheduling for a two-stage flow shop publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2010.08.011 – volume: 4 start-page: 46 issue: 1 year: 2017 ident: 10.1016/j.cie.2019.02.015_b0225 article-title: A single-machine scheduling problem with multiple unavailability constraints: A mathematical model and an enhanced variable neighborhood search approach publication-title: Journal of Computational Design and Engineering doi: 10.1016/j.jcde.2016.08.001 – volume: 18 start-page: 1 issue: 1 year: 2009 ident: 10.1016/j.cie.2019.02.015_b0200 article-title: Two-stage production scheduling with an option of outsourcing from a remote supplier publication-title: Journal of Systems Science and Systems Engineering doi: 10.1007/s11518-009-5094-1 – volume: 39 start-page: 1506 issue: 7 year: 2012 ident: 10.1016/j.cie.2019.02.015_b0100 article-title: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.08.022 – volume: 52 start-page: 3802 issue: 13 year: 2014 ident: 10.1016/j.cie.2019.02.015_b0155 article-title: An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop publication-title: International Journal of Production Research doi: 10.1080/00207543.2014.899719 – volume: 26 start-page: 489 issue: 3 year: 2013 ident: 10.1016/j.cie.2019.02.015_b0235 article-title: Single machine scheduling problems with subcontracting options publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-011-9442-y – volume: 213 start-page: 66 issue: 1 year: 2011 ident: 10.1016/j.cie.2019.02.015_b0040 article-title: Two-machine flow shop scheduling problem with an outsourcing option publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2011.03.017 – volume: 31 start-page: 487 issue: 1 year: 2016 ident: 10.1016/j.cie.2019.02.015_b0165 article-title: Manufacturing operations outsourcing through an artificial team process algorithm publication-title: Journal of Intelligent and Fuzzy Systems – volume: 252 start-page: 367 issue: 2 year: 2016 ident: 10.1016/j.cie.2019.02.015_b0045 article-title: Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.12.046 – volume: 61 start-page: 336 issue: 2 year: 2011 ident: 10.1016/j.cie.2019.02.015_b0065 article-title: Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2010.07.001 – volume: 226 start-page: 46 issue: 1 year: 2013 ident: 10.1016/j.cie.2019.02.015_b0055 article-title: Outsourcing and scheduling for two-machine ordered flow shop scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2012.10.048 – volume: 111 start-page: 623 issue: 2 year: 2008 ident: 10.1016/j.cie.2019.02.015_b0110 article-title: Single machine scheduling with outsourcing allowed publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2007.02.036 – volume: 54 start-page: 4793 issue: 16 year: 2016 ident: 10.1016/j.cie.2019.02.015_b0125 article-title: A shuffled frog-leaping algorithm for job shop scheduling with outsourcing options publication-title: International Journal of Production Research doi: 10.1080/00207543.2015.1088970 – volume: 24 start-page: 63 year: 2014 ident: 10.1016/j.cie.2019.02.015_b0130 article-title: A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2014.07.005 – volume: 40 start-page: 1234 issue: 5 year: 2013 ident: 10.1016/j.cie.2019.02.015_b0170 article-title: Scheduling with an outsourcing option on both manufacturer and subcontractors publication-title: Computers & Operations Research doi: 10.1016/j.cor.2012.12.003 |
| SSID | ssj0004591 |
| Score | 2.392198 |
| Snippet | •The two-machine flow shop outsourcing and rescheduling problem against the disruption of new arriving jobs is addressed.•A hybrid variable neighborhood search... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 198 |
| SubjectTerms | Outsourcing Rescheduling Two-machine flow shop Variable neighborhood search |
| Title | Outsourcing and rescheduling for a two-machine flow shop with the disruption of new arriving jobs: A hybrid variable neighborhood search algorithm |
| URI | https://dx.doi.org/10.1016/j.cie.2019.02.015 |
| Volume | 130 |
| WOSCitedRecordID | wos000466825100015&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: ScienceDirect Freedom Collection - Elsevier customDbUrl: eissn: 1879-0550 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtZ1Lb9NAEIBXUcoBDjwKiPLSHDhhGfntNbcIFQFChUNBuVlre5cmcu3Ij7TwM_jFzO56HbdQRA9crMiJN4_5MjszngchL_Io97JQCFvQsLCDWHh2FnNmszjDZ9CfCFX52NeP8dERXS6Tz7PZD1MLsy3jqqLn58nmv4oaz6GwZensNcQ9Loon8DEKHY8odjz-k-A_9Z2KyJvqQ_SnUTBFX445k1Z3VtunKouSW6Ksz6z2pN4MIVnEpli1Tb8xpiTa3RZrmpWKPKzrrNXF7CffZa2XtUVfW1VfVTLGikCpNslDLIWV3-oGVz2dmsBmjkSrqFvtRofwXWvEMU1o1avAAZ8GJ9xkktNiirIcWxp5FxTucCdGq0xXT6Eedl9P10v_pth1jGH9ChWezMdLVKNVXQh6sYn2pc1tTDk02WzrFJdI5RKp46WO7E-w58VhQudkb_H-cPlh0mtez1s0X8HcE1fZgZc-x5-tmomlcnyX3B5cDFhoNO6RGa_2yZ3B3YBBmbf75NakF-V98nPCDSA3MOUGkBtgMOEGJDcguQHJDSA3sOMGagHIDRhuQHLzGhagqQFDDUypAU0NjNQ8IF_eHh6_eWcPAzvs3A-dzmYJL9AkYiH6QrlsJBckggdOxv2CFmHm-hmNBGXUyZNCiCJmHu43BaMFEwFFS8p_SOZVXfFHBFzBoshz_ch3aBAEEcuSyBXom6ADwmjgHxDH_OAoUJ21IoeqlOmVgj4gL8dLNrqVy99eHBgppoMtqm3MFIm8-rLH13mPJ-Tm7j_zlMy7pufPyI1826G4ng84_gJgYq8G |
| 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=Outsourcing+and+rescheduling+for+a+two-machine+flow+shop+with+the+disruption+of+new+arriving+jobs%3A+A+hybrid+variable+neighborhood+search+algorithm&rft.jtitle=Computers+%26+industrial+engineering&rft.au=Liu%2C+Le&rft.date=2019-04-01&rft.issn=0360-8352&rft.volume=130&rft.spage=198&rft.epage=221&rft_id=info:doi/10.1016%2Fj.cie.2019.02.015&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cie_2019_02_015 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon |