{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T14:25:51Z","timestamp":1780323951004,"version":"3.54.1"},"reference-count":49,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["2022R1F1A1066641"],"award-info":[{"award-number":["2022R1F1A1066641"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejor.2025.12.048","type":"journal-article","created":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T06:44:24Z","timestamp":1767249864000},"page":"376-390","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-phase optimal and heuristic algorithms for flow shop scheduling with reworks under overlapped queue time limits"],"prefix":"10.1016","volume":"332","author":[{"given":"Hyeon-Il","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7679-5167","authenticated-orcid":false,"given":"Dong-Ho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"13","key":"10.1016\/j.ejor.2025.12.048_bib0001","doi-asserted-by":"crossref","first-page":"2955","DOI":"10.1080\/00207540600806463","article-title":"Influence of capacity-and time-constrained intermediate storage in two-stage food production systems","volume":"45","author":"Akkerman","year":"2007","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2025.12.048_bib0002","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.cor.2016.01.017","article-title":"Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times","volume":"71","author":"An","year":"2016","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.048_bib0003","series-title":"Principles of sequencing and scheduling","author":"Baker","year":"2013"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.048_bib0004","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1080\/02522667.2006.10699688","article-title":"Model formulations for the machine scheduling problem with limited waiting time constraints","volume":"27","author":"Chen","year":"2006","journal-title":"Journal of Information and Optimization Sciences"},{"key":"10.1016\/j.ejor.2025.12.048_bib0006","article-title":"A systematic review of permutation flow shop scheduling with due-date-related objectives","volume":"177","author":"de Athayde Prata","year":"2025","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.048_bib0007","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2024.11.034","article-title":"Transportation and delivery in flow-shop scheduling problems: A systematic review","volume":"325","author":"Fernandez-Viagas","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.048_bib0008","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.cor.2011.02.017","article-title":"A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints","volume":"39","author":"Gicquel","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.048_bib0009","doi-asserted-by":"crossref","first-page":"399","DOI":"10.5267\/j.ijiec.2017.2.001","article-title":"Flow-shop scheduling problem under uncertainties: Review and trends","volume":"8","author":"Gonz\u00e1lez-Neira","year":"2017","journal-title":"International Journal of Industrial Engineering Computations"},{"issue":"10","key":"10.1016\/j.ejor.2025.12.048_bib0010","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1080\/00207543.2011.594816","article-title":"Integer programming-based real-time dispatching (i-RTD) heuristic for wet-etch station at wafer fabrication","volume":"50","author":"Ham","year":"2012","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.048_bib0011","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/TASE.2010.2098867","article-title":"IP-based real time dispatching for two machine batching problem with time window constraints","volume":"8","author":"Ham","year":"2011","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"23","key":"10.1016\/j.ejor.2025.12.048_bib0012","doi-asserted-by":"crossref","DOI":"10.3390\/app112311240","article-title":"Heuristics for a two-stage assembly-type flow shop with limited waiting time constraints","volume":"11","author":"Han","year":"2021","journal-title":"Applied Sciences"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.048_bib0013","doi-asserted-by":"crossref","first-page":"152","DOI":"10.14743\/apem2023.2.463","article-title":"Genetic algorithm-based approach for makespan minimization in a flow shop with queue time limits and skipping jobs","volume":"18","author":"Han","year":"2023","journal-title":"Advances in Production Engineering & Management"},{"issue":"10","key":"10.1016\/j.ejor.2025.12.048_bib0014","doi-asserted-by":"crossref","first-page":"1742","DOI":"10.1080\/0305215X.2022.2124406","article-title":"Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing","volume":"55","author":"Han","year":"2023","journal-title":"Engineering Optimization"},{"issue":"10","key":"10.1016\/j.ejor.2025.12.048_bib0015","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","article-title":"Variable neighborhood search and local branching","volume":"33","author":"Hansen","year":"2006","journal-title":"Computers & Operations Research"},{"issue":"11\u201312","key":"10.1016\/j.ejor.2025.12.048_bib0016","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1016\/S0098-1354(01)00729-3","article-title":"A decomposition approach for the scheduling of a steel plant production","volume":"25","author":"Harjunkoski","year":"2001","journal-title":"Computers & Chemical Engineering"},{"key":"10.1016\/j.ejor.2025.12.048_bib0017","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cie.2018.08.024","article-title":"A two-phase decoding genetic algorithm for TFT-LCD array photolithography stage scheduling problem with constrained waiting time","volume":"125","author":"Hong","year":"2018","journal-title":"Computers & Industrial Engineering"},{"issue":"12","key":"10.1016\/j.ejor.2025.12.048_bib0018","doi-asserted-by":"crossref","first-page":"4565","DOI":"10.1080\/00207543.2023.2263577","article-title":"A comprehensive literature review of the flowshop group scheduling problems: Systematic and bibliometric reviews","volume":"62","author":"\u0130nce","year":"2024","journal-title":"International Journal of Production Research"},{"issue":"11","key":"10.1016\/j.ejor.2025.12.048_bib0019","doi-asserted-by":"crossref","first-page":"323","DOI":"10.3390\/a14110323","article-title":"Metaheuristics for a flow shop scheduling problem with urgent jobs and limited waiting times","volume":"14","author":"Jeong","year":"2021","journal-title":"Algorithms"},{"key":"10.1016\/j.ejor.2025.12.048_bib0020","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two-and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.048_bib0021","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1057\/palgrave.jors.2602598","article-title":"A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints","volume":"60","author":"Joo","year":"2009","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.048_bib0022","first-page":"266","article-title":"A scheduling algorithm for workstations with limited waiting time constraints in a semiconductor wafer fabrication facility","volume":"35","author":"Joo","year":"2009","journal-title":"Journal of the Korean Institute of Industrial Engineers"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.048_bib0023","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TSM.2014.2337310","article-title":"An effective problem decomposition method for scheduling of diffusion processes based on mixed integer programming","volume":"27","author":"Jung","year":"2014","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"key":"10.1016\/j.ejor.2025.12.048_bib0024","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.cor.2018.06.009","article-title":"Three-machine flow shop scheduling with overlapping waiting time constraints","volume":"101","author":"Kim","year":"2019","journal-title":"Computers & Operations Research"},{"issue":"20","key":"10.1016\/j.ejor.2025.12.048_bib0025","doi-asserted-by":"crossref","first-page":"6908","DOI":"10.1080\/00207543.2022.2139004","article-title":"Scheduling algorithms for multi-stage flow shops with reworks under overlapped queue time limits","volume":"61","author":"Kim","year":"2023","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2025.12.048_bib0026","doi-asserted-by":"crossref","unstructured":"Klemmt, A., & M\u00f6nch, L. (2012). Scheduling jobs with time constraints between consecutive process steps in semiconductor manufacturing. In Proceedings of the 2012 Winter Simulation Conference, Berlin, Germany, pp. 2173\u20132182.","DOI":"10.1109\/WSC.2012.6465235"},{"issue":"10","key":"10.1016\/j.ejor.2025.12.048_bib0027","doi-asserted-by":"crossref","first-page":"2926","DOI":"10.1080\/00207543.2018.1550269","article-title":"Flow shop scheduling problems with assembly operations: A review and new trends","volume":"57","author":"Komaki","year":"2019","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.048_bib0028","article-title":"A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times","volume":"2020","author":"Lee","year":"2020","journal-title":"Mathematical Problems in Engineering"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.048_bib0029","first-page":"39","article-title":"Scheduling of flow shop with sequence-dependent setup times and overlapping waiting time constraints to minimize the total completion time","volume":"48","author":"Lee","year":"2023","journal-title":"Journal of Korean Operations Research and Management Science Society"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.048_bib0030","doi-asserted-by":"crossref","first-page":"34","DOI":"10.7232\/JKIIE.2021.47.1.034","article-title":"Scheduling of flow shop with overlapping waiting time constraints using genetic algorithm","volume":"47","author":"Lee","year":"2021","journal-title":"Journal of the Korean Institute of Industrial Engineers"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.048_bib0031","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1080\/0305215X.2019.1593974","article-title":"A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time","volume":"52","author":"Li","year":"2020","journal-title":"Engineering Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.048_bib0032","first-page":"220","article-title":"Optimization of the flow-shop scheduling problem under time constraints with PSO algorithm","volume":"56","author":"Mansouri","year":"2023","journal-title":"Engineering Proceedings"},{"issue":"11","key":"10.1016\/j.ejor.2025.12.048_bib0033","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.048_bib0034","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121947","article-title":"Distributed permutation flow shop scheduling problem with worker flexibility: Review, trends and model proposition","volume":"238","author":"Mraihi","year":"2024","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.048_bib0035","first-page":"29","article-title":"A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing","volume":"27","author":"Ostermeier","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.048_bib0036","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ejor.2019.06.043","article-title":"Analysis of flow shop scheduling anomalies","volume":"280","author":"Panwalkar","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.048_bib0037","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.130310","article-title":"A genetic algorithm with feasibility-agnostic encoding and three-phase decoding for scheduling semiconductor manufacturing facilities under queue time limits","volume":"301","author":"Park","year":"2026","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.048_bib0038","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2023.02.001","article-title":"A review and classification on distributed permutation flowshop scheduling problems","volume":"312","author":"Perez-Gonzalez","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.048_bib0039","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1504\/IJOR.2020.104222","article-title":"Scheduling batches with time constraints in wafer fabrication","volume":"37","author":"Pirovano","year":"2020","journal-title":"International Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.048_bib0040","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.omega.2017.05.010","article-title":"The non-permutation flow-shop scheduling problem: A literature review","volume":"77","author":"Rossit","year":"2018","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.048_bib0041","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.ejor.2019.07.055","article-title":"A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems","volume":"289","author":"Rossit","year":"2021","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.048_bib0042","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0360-8352(02)00216-4","article-title":"A hybrid two-stage flowshop with limited waiting time constraints","volume":"44","author":"Su","year":"2003","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.048_bib0043","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSM.2015.2439054","article-title":"An algorithm of multi-subpopulation parameters with hybrid estimation of distribution for semiconductor scheduling with constrained waiting time","volume":"28","author":"Wang","year":"2015","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"key":"10.1016\/j.ejor.2025.12.048_bib0044","doi-asserted-by":"crossref","first-page":"1894","DOI":"10.4028\/www.scientific.net\/AMM.411-414.1894","article-title":"Neighborhood search heuristic for 2-machine flowshop scheduling problem with limited waiting times","volume":"411-414","author":"Wang","year":"2013","journal-title":"Applied Mechanics and Materials"},{"key":"10.1016\/j.ejor.2025.12.048_bib0045","doi-asserted-by":"crossref","first-page":"18076","DOI":"10.1109\/TASE.2024.3357610","article-title":"Fast schedule recovery method for semiconductor packaging lines with machine failures and constrained time windows","volume":"22","author":"Wang","year":"2025","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.048_bib0046","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0360-8352(94)00026-J","article-title":"A two-machine flowshop sequencing problem with limited waiting time constraints","volume":"28","author":"Yang","year":"1995","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.12.048_bib0047","article-title":"Lot streaming in hybrid flowshop scheduling problem by considering equal and consistent sublots under machine capability and limited waiting time constraint","volume":"173","author":"Y\u0131lmaz","year":"2022","journal-title":"Computers & Industrial Engineering"},{"issue":"11","key":"10.1016\/j.ejor.2025.12.048_bib0048","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.3934\/jimo.2024058","article-title":"Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time","volume":"20","author":"Y\u0131lmaz","year":"2024","journal-title":"Journal of Industrial and Management Optimization"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.048_bib0049","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1109\/TSM.2017.2662231","article-title":"Minimization of waiting time variation in a generalized two-machine flow shop with waiting time constraints and skipping jobs","volume":"30","author":"Yu","year":"2017","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"key":"10.1016\/j.ejor.2025.12.048_bib0050","doi-asserted-by":"crossref","unstructured":"Zhou, N., Wu, M., & Zhou, J. (2018). Research on power battery formation production scheduling problem with limited waiting time constraints. In: Proceedings of the International Conference on Communication Software and Networks, Chengdu, China, pp. 497\u2013501.","DOI":"10.1109\/ICCSN.2018.8488247"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722172501015X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722172501015X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T12:09:43Z","timestamp":1773835783000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722172501015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S037722172501015X"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.048","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Two-phase optimal and heuristic algorithms for flow shop scheduling with reworks under overlapped queue time limits","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.048","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}