{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:51:34Z","timestamp":1777956694601,"version":"3.51.4"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Industrial Engineering"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.cie.2026.111969","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:09:55Z","timestamp":1773158995000},"page":"111969","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Efficient lower bounds and heuristics for a symmetric two-stage hybrid flow shop with release dates, transportation, and delivery times"],"prefix":"10.1016","volume":"216","author":[{"given":"Wafa","family":"Omezine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahdi","family":"Jemmali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Nazih","family":"Omri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cie.2026.111969_b1","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109716","article-title":"Mathematical models for multi-stage hybrid assembly flow-shop scheduling with preventive maintenance and release times","volume":"186","author":"Anunay Alexander","year":"2023","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2026.111969_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108040","article-title":"Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling","volume":"168","author":"Azaiez","year":"2022","journal-title":"Computers & Industrial Engineering"},{"issue":"1\u20133","key":"10.1016\/j.cie.2026.111969_b3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0925-5273(99)00048-1","article-title":"Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness","volume":"64","author":"Botta-Genoulaz","year":"2000","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.cie.2026.111969_b4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:2000103","article-title":"An exact method for solving the multi-processor flow-shop","volume":"34","author":"Carlier","year":"2000","journal-title":"RAIRO - Operations Research"},{"issue":"4","key":"10.1016\/j.cie.2026.111969_b5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10288-015-0297-4","article-title":"A two-stage flow shop scheduling problem with transportation considerations","volume":"13","author":"Chikhi","year":"2015","journal-title":"4OR. A Quarterly Journal of Operations Research"},{"key":"10.1016\/j.cie.2026.111969_b6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.5267\/j.ijiec.2021.12.001","article-title":"An extensive and systematic literature review for hybrid flowshop scheduling problems","volume":"13","author":"\u00c7olak","year":"2022","journal-title":"International Journal of Industrial Engineering Computations"},{"key":"10.1016\/j.cie.2026.111969_b7","series-title":"The planning and scheduling of production systems: methodologies and applications","first-page":"163","article-title":"Production control in hybrid flow shop: An example from textile manufacturing","author":"Elmaghraby","year":"1997"},{"key":"10.1016\/j.cie.2026.111969_b8","doi-asserted-by":"crossref","DOI":"10.1155\/2019\/3176074","article-title":"The Lagrangean relaxation for the flow shop scheduling problem with precedence constraints, release dates and delivery times","volume":"2019","author":"Fabri","year":"2019","journal-title":"Journal of Advanced Transportation"},{"key":"10.1016\/j.cie.2026.111969_b9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1002\/jos.103","article-title":"Minimizing makespan on parallel machines subject to release dates and delivery times","volume":"5","author":"Gharbi","year":"2002","journal-title":"Journal of Scheduling"},{"issue":"3","key":"10.1016\/j.cie.2026.111969_b10","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","article-title":"Sequencing of jobs in some production system","volume":"125","author":"Grabowski","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111969_b11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/j.cie.2026.111969_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.jii.2023.100514","article-title":"Hybrid flow-shop scheduling in collaborative manufacturing with a multi-crossover-operator genetic algorithm","volume":"36","author":"Guan","year":"2023","journal-title":"Journal of Industrial Information Integration"},{"issue":"4","key":"10.1016\/j.cie.2026.111969_b13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","article-title":"Two-stage, hybrid flowshop scheduling problem","volume":"39","author":"Gupta","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.cie.2026.111969_b14","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1018976827443","article-title":"Scheduling a two-stage hybrid flow shop with parallel machines at the first stage","volume":"69","author":"Gupta","year":"1997","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/j.cie.2026.111969_b15","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1504\/IJAOM.2015.075026","article-title":"The two-stage hybrid flow shop problem with dedicated machines under release dates and delivery times","volume":"7","author":"Hajji","year":"2015","journal-title":"International Journal of Advanced Operations Management"},{"issue":"4","key":"10.1016\/j.cie.2026.111969_b16","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1504\/IJAOM.2015.075026","article-title":"The two-stage hybrid flow shop problem with dedicated machines under release dates and delivery times","volume":"7","author":"Hajji","year":"2015","journal-title":"International Journal of Advanced Operations Management"},{"key":"10.1016\/j.cie.2026.111969_b17","doi-asserted-by":"crossref","first-page":"21788","DOI":"10.1109\/ACCESS.2018.2826069","article-title":"Exact and heuristic procedures for the two-center hybrid flow shop scheduling problem with transportation times","volume":"6","author":"Hidri","year":"2018","journal-title":"IEEE Access"},{"issue":"7","key":"10.1016\/j.cie.2026.111969_b18","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.3390\/sym14071424","article-title":"Optimal solution to the two-stage hybrid flow shop scheduling problem with removal and transportation times","volume":"14","author":"Hidri","year":"2022","journal-title":"Symmetry"},{"key":"10.1016\/j.cie.2026.111969_b19","doi-asserted-by":"crossref","first-page":"563","DOI":"10.32604\/csse.2023.022716","article-title":"Hybrid flow shop with setup times scheduling problem","volume":"44","author":"Jemmali","year":"2022","journal-title":"Computer Systems Science and Engineering"},{"issue":"2","key":"10.1016\/j.cie.2026.111969_b20","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1111\/j.1937-5956.2002.tb00492.x","article-title":"Scheduling hybrid flowshops in printed circuit board assembly lines","volume":"11","author":"Jin","year":"2002","journal-title":"Production and Operations Management"},{"key":"10.1016\/j.cie.2026.111969_b21","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":"1","key":"10.1016\/j.cie.2026.111969_b22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/1099-1425(200101\/02)4:1<3::AID-JOS57>3.0.CO;2-D","article-title":"Machine scheduling with transportation considerations","volume":"4","author":"Lee","year":"2001","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.cie.2026.111969_b23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(94)90026-4","article-title":"Minimizing makespan in hybrid flowshop","volume":"16","author":"Lee","year":"1994","journal-title":"Operations Research Letters"},{"issue":"6","key":"10.1016\/j.cie.2026.111969_b24","doi-asserted-by":"crossref","first-page":"1755","DOI":"10.1016\/j.asoc.2012.01.011","article-title":"An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem","volume":"12","author":"Liao","year":"2012","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.cie.2026.111969_b25","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.simpat.2014.10.008","article-title":"Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing","volume":"51","author":"Lin","year":"2015","journal-title":"Simulation Modelling Practice and Theory"},{"key":"10.1016\/j.cie.2026.111969_b26","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ijpe.2015.10.002","article-title":"A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times","volume":"170","author":"Liou","year":"2015","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.cie.2026.111969_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2022.102478","article-title":"Agent-based simulation and optimization of hybrid flow shop considering multi-skilled workers and fatigue factors","volume":"80","author":"Liu","year":"2023","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"issue":"13","key":"10.1016\/j.cie.2026.111969_b28","doi-asserted-by":"crossref","first-page":"3905","DOI":"10.1080\/00207543.2019.1636324","article-title":"More MILP models for hybrid flow shop scheduling problem and its extended problems","volume":"58","author":"Meng","year":"2020","journal-title":"International Journal of Production Research"},{"issue":"6","key":"10.1016\/j.cie.2026.111969_b29","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1007\/s10845-009-0373-8","article-title":"A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times","volume":"22","author":"Mirsanei","year":"2011","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"11","key":"10.1016\/j.cie.2026.111969_b30","first-page":"1081","article-title":"A branch-and-bound algorithm for the hybrid flowshop scheduling problem","volume":"27","author":"Moursli","year":"2000","journal-title":"Computers & Operations Research"},{"issue":"11","key":"10.1016\/j.cie.2026.111969_b31","first-page":"1081","article-title":"A branch-and-bound algorithm for the hybrid flowshop scheduling problem","volume":"27","author":"Moursli","year":"2000","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2026.111969_b32","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.procs.2018.07.235","article-title":"A two-stage hybrid flow shop problem with dedicated machine and release date","volume":"126","author":"Nabli","year":"2018","journal-title":"Procedia Computer Science"},{"key":"10.1016\/j.cie.2026.111969_b33","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.procs.2018.07.235","article-title":"A two-stage hybrid flow shop problem with dedicated machine and release date","volume":"126","author":"Nabli","year":"2018","journal-title":"Procedia Computer Science"},{"key":"10.1016\/j.cie.2026.111969_b34","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.procs.2024.09.165","article-title":"Resolving a hybrid flow shop problem with dedicated machines: Incorporating blocking and release date constraints","volume":"246","author":"Nabli","year":"2024","journal-title":"Procedia Computer Science"},{"key":"10.1016\/j.cie.2026.111969_b35","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.procs.2024.09.165","article-title":"Resolving a hybrid flow shop problem with dedicated machines: Incorporating blocking and release date constraints","volume":"246","author":"Nabli","year":"2024","journal-title":"Procedia Computer Science"},{"issue":"4","key":"10.1016\/j.cie.2026.111969_b36","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1016\/j.cie.2009.06.005","article-title":"Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization","volume":"57","author":"Naderi","year":"2009","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"10.1016\/j.cie.2026.111969_b37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","article-title":"The hybrid flow shop scheduling problem","volume":"205","author":"Ruiz","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.cie.2026.111969_b38","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.3390\/jmse13061153","article-title":"Energy-efficient scheduling for resilient container-supply hybrid flow shops under transportation constraints and stochastic arrivals","volume":"13","author":"Shi","year":"2025","journal-title":"Journal of Marine Science and Engineering"},{"issue":"4","key":"10.1016\/j.cie.2026.111969_b39","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/j.cor.2012.10.015","article-title":"A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem","volume":"40","author":"Wang","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.cie.2026.111969_b40","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/TSMC.2023.3305089","article-title":"Hybrid flow shop scheduling with learning effects and release dates to minimize the makespan","volume":"54","author":"Wang","year":"2024","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"issue":"4","key":"10.1016\/j.cie.2026.111969_b41","doi-asserted-by":"crossref","first-page":"282","DOI":"10.23919\/CSMS.2023.0016","article-title":"Intelligent optimization under multiple factories: Hybrid flow shop scheduling problem with blocking constraints using an advanced iterated greedy algorithm","volume":"3","author":"Wang","year":"2023","journal-title":"Complex System Modeling and Simulation"},{"key":"10.1016\/j.cie.2026.111969_b42","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1007\/s10845-011-0571-z","article-title":"Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints","volume":"23","author":"Wang","year":"2012","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/j.cie.2026.111969_b43","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118278","article-title":"Optimizing job release and scheduling jointly in a reentrant hybrid flow shop","volume":"209","author":"Wu","year":"2022","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.cie.2026.111969_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2025.110917","article-title":"A feature based neural network model for distributed flexible flow shop scheduling considering worker and transportation factors","volume":"201","author":"Xu","year":"2025","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"10.1016\/j.cie.2026.111969_b45","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.ijpe.2004.11.002","article-title":"New exact method to solve the Pm|rj|\u2211Cj scheduling problem","volume":"100","author":"Yalaoui","year":"2006","journal-title":"International Journal of Production Economics"},{"issue":"12","key":"10.1016\/j.cie.2026.111969_b46","article-title":"A three-stage multiobjective approach based on decomposition for an energy-efficient hybrid flow shop scheduling problem","volume":"50","author":"Zhang","year":"2020","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"10.1016\/j.cie.2026.111969_b47","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s40305-014-0040-4","article-title":"Hybrid flowshop scheduling with interstage job transportation","volume":"2","author":"Zhong","year":"2014","journal-title":"Journal of the Operational Research Society of China"}],"container-title":["Computers &amp; Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835226001701?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835226001701?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T03:32:23Z","timestamp":1777951943000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835226001701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":47,"alternative-id":["S0360835226001701"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2026.111969","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient lower bounds and heuristics for a symmetric two-stage hybrid flow shop with release dates, transportation, and delivery times","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2026.111969","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"111969"}}