{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:18Z","timestamp":1740122418958,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T00:00:00Z","timestamp":1718496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T00:00:00Z","timestamp":1718496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10878-024-01180-4","type":"journal-article","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T09:01:44Z","timestamp":1718528504000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New efficient algorithms for the two-machine no-wait chain-reentrant shop problem"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7022-6193","authenticated-orcid":false,"given":"Nazim","family":"Sami","sequence":"first","affiliation":[]},{"given":"Karim","family":"Amrouche","sequence":"additional","affiliation":[]},{"given":"Mourad","family":"Boudhar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,16]]},"reference":[{"issue":"4","key":"1180_CR1","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.orl.2006.09.006","volume":"35","author":"AA Ageev","year":"2007","unstructured":"Ageev AA, Baburin AE (2007) Approximation algorithms for UET scheduling problems with exact delays. Oper Res Lett 35(4):533\u2013540","journal-title":"Oper Res Lett"},{"issue":"2","key":"1180_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s001860300328","volume":"59","author":"D Ahr","year":"2004","unstructured":"Ahr D, B\u00e9k\u00e9si J, Galambos G, Oswald M, Reinelt G (2004) An exact algorithm for scheduling identical coupled tasks. Math Methods Oper Res 59(2):193\u2013203","journal-title":"Math Methods Oper Res"},{"issue":"3","key":"1180_CR3","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.ejor.2016.05.036","volume":"255","author":"A Allahverdi","year":"2016","unstructured":"Allahverdi A (2016) A survey of scheduling problems with no-wait in process. Eur J Oper Res 255(3):665\u2013686","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1180_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1051\/ro\/2015015","volume":"50","author":"K Amrouche","year":"2016","unstructured":"Amrouche K, Boudhar M (2016) Two machines flow shop with reentrance and exact time lag. RAIRO Oper Res 50(2):223\u2013232","journal-title":"RAIRO Oper Res"},{"key":"1180_CR5","doi-asserted-by":"crossref","unstructured":"Amrouche K, Boudhar M, Yalaoui F (2016) The chain-reentrant shop with the no-wait constraint. IFAC-PapersOnLine 49(12):414\u2013418. 8th IFAC conference on manufacturing modelling, management and control MIM 2016","DOI":"10.1016\/j.ifacol.2016.07.641"},{"issue":"1","key":"1180_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1080\/00207543.2016.1205235","volume":"55","author":"K Amrouche","year":"2017","unstructured":"Amrouche K, Boudhar M, Bendraouche M, Yalaoui F (2017) Chain-reentrant shop with an exact time lag: new results. Int J Prod Res 55(1):285\u2013295","journal-title":"Int J Prod Res"},{"issue":"4","key":"1180_CR7","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1504\/EJIE.2020.108577","volume":"14","author":"K Amrouche","year":"2020","unstructured":"Amrouche K, Boudhar M, Sami N (2020) Two-machine chain-reentrant flow shop with the no-wait constraint. Eur J Ind Eng 14(4):573\u2013597","journal-title":"Eur J Ind Eng"},{"key":"1180_CR8","doi-asserted-by":"crossref","unstructured":"Cheng Y, Lei D (2018) An improved imperialist competitive algorithm for reentrant flow shop scheduling. In: Proceedings of the Chinese control conference (CCC 2018), pp 2206\u20132211","DOI":"10.23919\/ChiCC.2018.8483063"},{"key":"1180_CR9","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1023\/A:1018927407164","volume":"86","author":"IG Drobouchevitch","year":"1999","unstructured":"Drobouchevitch IG, Strusevich VA (1999) A heuristic algorithm for two-machine re-entrant shop scheduling. Ann Oper Res 86:417\u2013439","journal-title":"Ann Oper Res"},{"key":"1180_CR10","first-page":"269","volume-title":"Reentrant flow shops","author":"H Emmons","year":"2013","unstructured":"Emmons H, Vairaktarakis G (2013) Reentrant flow shops. Springer, Boston, pp 269\u2013289"},{"issue":"5","key":"1180_CR11","doi-asserted-by":"publisher","first-page":"913","DOI":"10.3390\/sym14050913","volume":"14","author":"Y Gao","year":"2022","unstructured":"Gao Y, Wang Z, Gao L, Li X (2022) A matheuristic approach for the no-wait flowshop scheduling problem with makespan criterion. Symmetry 14(5):913","journal-title":"Symmetry"},{"key":"1180_CR12","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness, 1st edn. Series of books in the mathematical sciences, W. H. Freeman"},{"issue":"2","key":"1180_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"issue":"5","key":"1180_CR14","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"PC Gilmore","year":"1964","unstructured":"Gilmore PC, Gomory RE (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12(5):655\u2013679","journal-title":"Oper Res"},{"issue":"4","key":"1180_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0272-6963(83)90004-9","volume":"3","author":"SC Graves","year":"1983","unstructured":"Graves SC, Meal HC, Stefek D, Zeghmi Hamid A (1983) Scheduling of re-entrant flow shops. J Oper Manag 3(4):197\u2013207","journal-title":"J Oper Manag"},{"issue":"10","key":"1180_CR16","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1080\/0951192X.2017.1285425","volume":"30","author":"W Jia","year":"2017","unstructured":"Jia W, Chen H, Liu L, Jiang Z, Li Y (2017) Full-batch-oriented scheduling algorithm on batch processing workstation of $$\\beta 1 \\rightarrow \\beta 2$$ type with re-entrant flow. Int J Comput Integr Manuf 30(10):1029\u20131042","journal-title":"Int J Comput Integr Manuf"},{"key":"1180_CR17","doi-asserted-by":"crossref","unstructured":"Jing C, Qian X, Tang G (2008) Two-machine flow shop scheduling with re-entrance. In: 2008 international conference on information management, innovation management and industrial engineering, vol\u00a02, pp 528\u2013531","DOI":"10.1109\/ICIII.2008.81"},{"issue":"1","key":"1180_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Res Logist Q 1(1):61\u201368","journal-title":"Naval Res Logist Q"},{"issue":"1","key":"1180_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2019.08.045","volume":"282","author":"M Khatami","year":"2020","unstructured":"Khatami M, Salehipour A, Cheng T (2020) Coupled task scheduling with exact delays: literature review and models. Eur J Oper Res 282(1):19\u201339","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1180_CR20","doi-asserted-by":"publisher","first-page":"2376","DOI":"10.1038\/s41598-023-47729-x","volume":"14","author":"B Khurshid","year":"2024","unstructured":"Khurshid B, Maqsood S, Khurshid Y, Naeem K, Khalid QS (2024) A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems. Sci Rep 14(1):2376","journal-title":"Sci Rep"},{"issue":"23","key":"1180_CR21","doi-asserted-by":"publisher","first-page":"7130","DOI":"10.1080\/00207543.2019.1693653","volume":"58","author":"C Le Hesran","year":"2020","unstructured":"Le Hesran C, Agarwal A, Ladier A, Botta-Genoulaz V, Laforest V (2020) Reducing waste in manufacturing operations: bi-objective scheduling on a single-machine with coupled-tasks. Int J Prod Res 58(23):7130\u20137148","journal-title":"Int J Prod Res"},{"issue":"1","key":"1180_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0377-2217(84)90260-1","volume":"18","author":"V Lev","year":"1984","unstructured":"Lev V, Adiri I (1984) V-shop scheduling. Eur J Oper Res 18(1):51\u201356","journal-title":"Eur J Oper Res"},{"key":"1180_CR23","unstructured":"Lorenzo L (2017) Minimizing makespan in a class of two-stage chain reentrant hybrid flow shops. In: Proceedings of the world congress on engineering 2017 (WCE 2017), vol I, pp 50\u201356"},{"issue":"6","key":"1180_CR24","doi-asserted-by":"publisher","first-page":"3237","DOI":"10.1111\/itor.13108","volume":"29","author":"CRH Marquez","year":"2022","unstructured":"Marquez CRH, Ribeiro CC (2022) Shop scheduling in manufacturing environments: a review. Int Trans Oper Res 29(6):3237\u20133293","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"1180_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(96)00041-8","volume":"72","author":"A Orman","year":"1997","unstructured":"Orman A, Potts C (1997) On the complexity of coupled-task scheduling. Discrete Appl Math 72(1):141\u2013154","journal-title":"Discrete Appl Math"},{"issue":"3","key":"1180_CR26","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/322203.322213","volume":"27","author":"CH Papadimitriou","year":"1980","unstructured":"Papadimitriou CH, Kanellakis PC (1980) Flowshop scheduling with limited temporary storage. J ACM 27(3):533\u2013549","journal-title":"J ACM"},{"issue":"2","key":"1180_CR27","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/62.65","volume":"31","author":"H R\u00f6ck","year":"1984","unstructured":"R\u00f6ck H (1984) The three-machine no-wait flow shop is np-complete. J ACM 31(2):336\u2013345","journal-title":"J ACM"},{"issue":"3","key":"1180_CR28","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/nav.3800270312","volume":"27","author":"RD Shapiro","year":"1980","unstructured":"Shapiro RD (1980) Scheduling coupled tasks. Naval Res Logist Q 27(3):489\u2013498","journal-title":"Naval Res Logist Q"},{"issue":"5","key":"1180_CR29","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1287\/opre.45.5.702","volume":"45","author":"MY Wang","year":"1997","unstructured":"Wang MY, Sethi SP, van de Velde SL (1997) Minimizing makespan in a class of reentrant shops. Oper Res 45(5):702\u2013712","journal-title":"Oper Res"},{"key":"1180_CR30","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.omega.2019.102117","volume":"94","author":"X Wu","year":"2020","unstructured":"Wu X, Che A (2020) Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search. Omega 94:102\u2013117","journal-title":"Omega"},{"issue":"24","key":"1180_CR31","first-page":"2994","volume":"30","author":"Y Yao","year":"2019","unstructured":"Yao Y, Ye C (2019) IMSSA for TFT-LCD panel array process scheduling problem considering energy saving. China Mech Eng 30(24):2994\u20133003","journal-title":"China Mech Eng"},{"issue":"9\u201310","key":"1180_CR32","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1177\/00202940231180622","volume":"56","author":"S Zhang","year":"2023","unstructured":"Zhang S, Gu X (2023) A discrete whale optimization algorithm for the no-wait flow shop scheduling problem. Meas Control (UK) 56(9\u201310):1764\u20131779","journal-title":"Meas Control (UK)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01180-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01180-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01180-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T14:41:21Z","timestamp":1721659281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01180-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,16]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1180"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01180-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,6,16]]},"assertion":[{"value":"6 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"83"}}