{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:52:39Z","timestamp":1776117159986,"version":"3.50.1"},"reference-count":82,"publisher":"Elsevier BV","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\/501100006579","name":"Ministry of Industry and Information Technology of the People&apos;s Republic of China","doi-asserted-by":"publisher","award":["2026ZD1609000"],"award-info":[{"award-number":["2026ZD1609000"]}],"id":[{"id":"10.13039\/501100006579","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72401214"],"award-info":[{"award-number":["72401214"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["92567301"],"award-info":[{"award-number":["92567301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["92467302"],"award-info":[{"award-number":["92467302"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72361137004"],"award-info":[{"award-number":["72361137004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People&apos;s Republic of China","doi-asserted-by":"publisher","award":["24YJC630078"],"award-info":[{"award-number":["24YJC630078"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.cor.2026.107470","type":"journal-article","created":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T07:35:42Z","timestamp":1774078542000},"page":"107470","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Robotic flow shop scheduling problem with combined buffer conditions"],"prefix":"10.1016","volume":"191","author":[{"given":"Zhaofang","family":"Mao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0415-3387","authenticated-orcid":false,"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kan","family":"Fang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0827-3468","authenticated-orcid":false,"given":"Yiting","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7853-1747","authenticated-orcid":false,"given":"Dian","family":"Huang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/j.cor.2026.107470_b1","doi-asserted-by":"crossref","first-page":"2788","DOI":"10.1080\/00207543.2014.885664","article-title":"A hybrid scheduling approach for automated flowshops with material handling and time constraints","volume":"52","author":"Aguirre","year":"2014","journal-title":"Int. J. Prod. Res."},{"issue":"9","key":"10.1016\/j.cor.2026.107470_b2","doi-asserted-by":"crossref","first-page":"3288","DOI":"10.1080\/00207543.2023.2230489","article-title":"Integrated job-shop scheduling in an FMS with heterogeneous transporters: MILP formulation, constraint programming, and branch-and-bound","volume":"62","author":"Ahmadi-Javid","year":"2024","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107470_b3","doi-asserted-by":"crossref","first-page":"4382","DOI":"10.1109\/TASE.2023.3296087","article-title":"A branch and bound algorithm for scheduling of flexible manufacturing systems","volume":"21","author":"Ahn","year":"2024","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"2\u20133","key":"10.1016\/j.cor.2026.107470_b4","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1007\/s10479-024-06097-z","article-title":"Solving the two-machine open shop problem with a single server with respect to the makespan","volume":"338","author":"Babou","year":"2024","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b5","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1016\/j.ijpe.2011.10.006","article-title":"Multiple part-type scheduling in flexible robotic cells","volume":"135","author":"Batur","year":"2012","journal-title":"Int. J. Prod. Econ."},{"issue":"17","key":"10.1016\/j.cor.2026.107470_b6","doi-asserted-by":"crossref","first-page":"4341","DOI":"10.1080\/00207540210159608","article-title":"Scheduling production tasks in a two-stage FMS","volume":"40","author":"B\u0142a\u017cewicz","year":"2002","journal-title":"Int. J. Prod. Res."},{"issue":"12","key":"10.1016\/j.cor.2026.107470_b7","doi-asserted-by":"crossref","first-page":"3200","DOI":"10.1016\/j.cor.2012.04.008","article-title":"A branch and bound algorithm for the cyclic job-shop problem with transportation","volume":"39","author":"Brucker","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b8","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.ejor.2004.04.010","article-title":"Complexity results for flow-shop problems with a single server","volume":"165","author":"Brucker","year":"2005","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107470_b9","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2009.06.035","article-title":"An optimization-based heuristic for the robotic cell problem","volume":"202","author":"Carlier","year":"2010","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107470_b10","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1016\/j.ejor.2017.01.033","article-title":"An efficient bicriteria algorithm for stable robotic flow shop scheduling","volume":"260","author":"Che","year":"2017","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10732-018-9391-z","article-title":"Scheduling of mobile robots for transportation and manufacturing tasks","volume":"25","author":"Dang","year":"2019","journal-title":"J. Heuristics"},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b12","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/msom.1070.0208","article-title":"Multiple part-type production in robotic cells: Equivalence of two real-world models","volume":"11","author":"Dawande","year":"2009","journal-title":"M&Som-Manufacturing Serv. Oper. Manag."},{"issue":"3","key":"10.1016\/j.cor.2026.107470_b13","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.ejor.2010.03.002","article-title":"Throughput optimization in robotic cells with input and output machine buffers: A comparative study of two key models","volume":"206","author":"Drobouchevitch","year":"2010","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b14","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.ejor.2004.09.019","article-title":"Scheduling dual gripper robotic cell: One-unit cycles","volume":"171","author":"Drobouchevitch","year":"2006","journal-title":"European J. Oper. Res."},{"issue":"20","key":"10.1016\/j.cor.2026.107470_b15","doi-asserted-by":"crossref","first-page":"6166","DOI":"10.1080\/00207543.2020.1807637","article-title":"Mathematical formulations for the parallel machine scheduling problem with a single server","volume":"59","author":"Elidrissi","year":"2021","journal-title":"Int. J. Prod. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107470_b16","doi-asserted-by":"crossref","first-page":"3240","DOI":"10.1109\/TEM.2020.3037371","article-title":"Cyclic flow shop robotic cell scheduling problem with multiple part types","volume":"69","author":"Elmi","year":"2022","journal-title":"IEEE Trans. Eng. Manage."},{"issue":"12","key":"10.1016\/j.cor.2026.107470_b17","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1080\/0951192X.2013.874576","article-title":"Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot","volume":"27","author":"Elmi","year":"2014","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107470_b18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.cor.2016.03.007","article-title":"Multi-degree cyclic flow shop robotic cell scheduling problem: Ant colony optimization","volume":"73","author":"Elmi","year":"2016","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107470_b19","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1007\/s10957-016-1056-1","article-title":"Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers","volume":"173","author":"Espinouse","year":"2017","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cor.2026.107470_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105998","article-title":"Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters","volume":"148","author":"Fan","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107470_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2022.102770","article-title":"Scheduling of multi-robot job shop systems in dynamic environments: Mixed-integer linear programming and constraint programming approaches","volume":"115","author":"Fatemi-Anaraki","year":"2023","journal-title":"Omega"},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b22","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.ejor.2024.01.041","article-title":"Scheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity","volume":"319","author":"Feng","year":"2024","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107470_b23","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1080\/0951192X.2012.684722","article-title":"Analysis of flexible robotic cells with improved pure cycle","volume":"26","author":"Foumani","year":"2013","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107470_b24","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2021.01.019","article-title":"Planning and control of autonomous mobile robots for intralogistics: Literature review and research agenda","volume":"294","author":"Fragapane","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107470_b25","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-020-03526-7","article-title":"Increasing flexibility and productivity in industry 4.0 production networks with autonomous mobile robots and smart intralogistics","volume":"308","author":"Fragapane","year":"2022","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107470_b26","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0305-0483(03)00047-1","article-title":"An efficient constructive heuristic for flowtime minimisation in permutation flow shops","volume":"31","author":"Framinan","year":"2003","journal-title":"Omega"},{"key":"10.1016\/j.cor.2026.107470_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109349","article-title":"Solving a new bi-objective mathematical model for a hybrid flow shop scheduling problem with robots and fuzzy maintenance time","volume":"182","author":"Ghodratnama","year":"2023","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"10.1016\/j.cor.2026.107470_b28","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1002\/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1","article-title":"Scheduling for parallel dedicated machines with a single server","volume":"47","author":"Glass","year":"2000","journal-title":"Naval Res. Logist."},{"key":"10.1016\/j.cor.2026.107470_b29","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.cor.2017.09.018","article-title":"Cyclic scheduling of parts and robot moves in m-machine robotic cells","volume":"90","author":"Gultekin","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107470_b30","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1080\/0740817X.2015.1047475","article-title":"Scheduling in two-machine robotic cells with a self-buffered robot","volume":"48","author":"Gundogdu","year":"2016","journal-title":"IIE Trans."},{"key":"10.1016\/j.cor.2026.107470_b31","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1080\/00207543.2019.1709671","article-title":"Transfer-robot task scheduling in job shop","volume":"59","author":"Ham","year":"2020","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107470_b32","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/j.ejor.2023.10.013","article-title":"Scheduling in manufacturing with transportation: Classification and solution techniques","volume":"315","author":"Hosseini","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107470_b33","series-title":"About world robotics","author":"International Federation of Robotics","year":"2024"},{"issue":"5","key":"10.1016\/j.cor.2026.107470_b34","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1111\/itor.12136","article-title":"Online algorithms for scheduling two parallel machines with a single server","volume":"22","author":"Jiang","year":"2015","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b35","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10878-014-9727-z","article-title":"Single-server parallel-machine scheduling with loading and unloading times","volume":"30","author":"Jiang","year":"2015","journal-title":"J. Comb. Optim."},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b36","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1080\/07408170600735553","article-title":"An improved version of the NEH algorithm and its application to large-scale flow-shop scheduling problems","volume":"39","author":"Jin","year":"2007","journal-title":"IIE Trans."},{"issue":"11","key":"10.1016\/j.cor.2026.107470_b37","doi-asserted-by":"crossref","first-page":"2457","DOI":"10.1016\/j.cor.2011.12.011","article-title":"MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server","volume":"39","author":"Kim","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107470_b38","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1109\/TSMC.2023.3317390","article-title":"Deep reinforcement learning with a look-ahead search for robotic cell scheduling","volume":"54","author":"Kim","year":"2023","journal-title":"IEEE Trans. Syst. Man, Cybern.: Syst."},{"issue":"1","key":"10.1016\/j.cor.2026.107470_b39","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/TSM.2020.2965293","article-title":"Deep learning-based dynamic scheduling for semiconductor manufacturing with high uncertainty of automated material handling system capability","volume":"33","author":"Kim","year":"2020","journal-title":"IEEE Trans. Semicond. Manuf."},{"issue":"4598","key":"10.1016\/j.cor.2026.107470_b40","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"7","key":"10.1016\/j.cor.2026.107470_b41","doi-asserted-by":"crossref","first-page":"2346","DOI":"10.1080\/00207543.2021.1887533","article-title":"Reinforcement learning for robotic flow shop scheduling with processing time variations","volume":"60","author":"Lee","year":"2022","journal-title":"Int. J. Prod. Res."},{"issue":"8","key":"10.1016\/j.cor.2026.107470_b42","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1080\/07408170590918290","article-title":"Two-machine shop scheduling with an uncapacitated interstage transporter","volume":"37","author":"Lee","year":"2005","journal-title":"IIE Trans."},{"key":"10.1016\/j.cor.2026.107470_b43","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2019.07.041","article-title":"Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times","volume":"139","author":"Lei","year":"2020","journal-title":"Comput. Ind. Eng."},{"issue":"107907","key":"10.1016\/j.cor.2026.107470_b44","first-page":"9625","article-title":"An improved iterated greedy algorithm for distributed robotic flowshop scheduling with order constraints","volume":"164","author":"Li","year":"2022","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"10.1016\/j.cor.2026.107470_b45","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10951-006-8787-z","article-title":"Two-machine flow shop problems with a single server","volume":"9","author":"Lim","year":"2006","journal-title":"J. Sched."},{"key":"10.1016\/j.cor.2026.107470_b46","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ijpe.2017.06.026","article-title":"A new improved NEH heuristic for permutation flowshop scheduling problems","volume":"193","author":"Liu","year":"2017","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b47","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.ijpe.2008.11.007","article-title":"Scheduling a flow shop with combined buffer conditions","volume":"117","author":"Liu","year":"2009","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2026.107470_b48","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.cor.2016.09.011","article-title":"A hybrid metaheuristic algorithm to optimise a real-world robotic cell","volume":"84","author":"Liu","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"10.1016\/j.cor.2026.107470_b49","doi-asserted-by":"crossref","first-page":"3274","DOI":"10.1080\/00207543.2017.1401240","article-title":"Job shop scheduling with a combination of four buffering constraints","volume":"56","author":"Liu","year":"2018","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107470_b50","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0377-2217(96)00055-0","article-title":"A global MILP model for FMS scheduling","volume":"100","author":"Liu","year":"1997","journal-title":"European J. Oper. Res."},{"issue":"17","key":"10.1016\/j.cor.2026.107470_b51","doi-asserted-by":"crossref","first-page":"6030","DOI":"10.1080\/00207543.2022.2122619","article-title":"A new knowledge-guided multi-objective optimisation for the multi-AGV dispatching problem in dynamic production environments","volume":"61","author":"Liu","year":"2023","journal-title":"Int. J. Prod. Res."},{"issue":"9","key":"10.1016\/j.cor.2026.107470_b52","doi-asserted-by":"crossref","first-page":"2791","DOI":"10.1016\/j.cor.2006.12.013","article-title":"An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers","volume":"35","author":"Liu","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107470_b53","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107011","article-title":"Predictive model-based multi-objective optimization with life-long meta-learning for designing unreliable production systems","volume":"178","author":"Mahmoodi","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107470_b54","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106605","article-title":"Model and metaheuristic for human-robot collaboration assembly line worker assignment and balancing problem","volume":"165","author":"Mao","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107470_b55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/24725854.2025.2561569","article-title":"Job shop scheduling problem with a dual-gripper robot","author":"Mao","year":"2025","journal-title":"IISE Trans."},{"issue":"6","key":"10.1016\/j.cor.2026.107470_b56","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","article-title":"A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations","volume":"14","author":"Moench","year":"2011","journal-title":"J. Sched."},{"key":"10.1016\/j.cor.2026.107470_b57","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.cor.2013.09.014","article-title":"A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion","volume":"52","author":"Moslehi","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"105296","key":"10.1016\/j.cor.2026.107470_b58","article-title":"N-NEH plus algorithm for solving permutation flow shop problems","volume":"132","author":"Puka","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"106473","key":"10.1016\/j.cor.2026.107470_b59","article-title":"Deterministic constructive vN-NEH plus algorithm to solve permutation flow shop scheduling problem with makespan criterion","volume":"162","author":"Puka","year":"2024","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b60","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1287\/opre.1100.0874","article-title":"Quantifying the impact of layout on productivity: An analysis from robotic-cell manufacturing","volume":"59","author":"Rajapakshe","year":"2011","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107470_b61","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2019.101834","article-title":"Intelligent service capacity allocation for cross-border-e-commerce related third-party-forwarding logistics operations: A deep learning approach","volume":"134","author":"Ren","year":"2020","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"17","key":"10.1016\/j.cor.2026.107470_b62","doi-asserted-by":"crossref","first-page":"5238","DOI":"10.1080\/00207543.2013.802390","article-title":"An efficient iterated local search algorithm for the total tardiness blocking flow shop problem","volume":"51","author":"Ribas","year":"2013","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107470_b63","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0925-5273(99)00043-2","article-title":"An LP-based approach for loading and routing in a flexible assembly line","volume":"64","author":"Sawik","year":"2000","journal-title":"Int. J. Prod. Econ."},{"issue":"3\u20134","key":"10.1016\/j.cor.2026.107470_b64","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01324886","article-title":"Sequencing of parts and robot moves in a robotic cell","volume":"4","author":"Sethi","year":"1992","journal-title":"Int. J. Flexible Manuf. Syst."},{"issue":"5\u20136","key":"10.1016\/j.cor.2026.107470_b65","doi-asserted-by":"crossref","first-page":"4231","DOI":"10.1016\/j.apm.2015.11.021","article-title":"Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times","volume":"40","author":"Shabtay","year":"2016","journal-title":"Appl. Math. Model."},{"issue":"1","key":"10.1016\/j.cor.2026.107470_b66","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.ejor.2003.08.028","article-title":"Resolution of a scheduling problem in a flowshop robotic cell","volume":"161","author":"Soukhal","year":"2005","journal-title":"European J. Oper. Res."},{"issue":"9","key":"10.1016\/j.cor.2026.107470_b67","doi-asserted-by":"crossref","first-page":"2952","DOI":"10.1016\/j.cor.2007.01.002","article-title":"The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time","volume":"35","author":"Su","year":"2008","journal-title":"Comput. Oper. Res."},{"issue":"102273","key":"10.1016\/j.cor.2026.107470_b68","article-title":"Novel robotic job-shop scheduling models with deadlock and robot movement considerations","volume":"149","author":"Sun","year":"2021","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.cor.2026.107470_b69","series-title":"Introduction to Quality Engineering: Designing Quality into Products and Processes","author":"Taguchi","year":"1986"},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b70","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107470_b71","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1080\/00207543.2024.2373426","article-title":"Integrated scheduling of multi-objective lot-streaming hybrid flowshop with AGV based on deep reinforcement learning","volume":"63","author":"Tang","year":"2025","journal-title":"Int. J. Prod. Res."},{"issue":"23","key":"10.1016\/j.cor.2026.107470_b72","doi-asserted-by":"crossref","first-page":"7094","DOI":"10.1080\/00207543.2020.1764656","article-title":"Cascade neural network algorithm with analytical connection weights determination for modelling operations and energy applications","volume":"58","author":"Wang","year":"2020","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b73","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/S0377-2217(02)00873-1","article-title":"A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities","volume":"155","author":"Wardono","year":"2004","journal-title":"European J. Oper. Res."},{"issue":"17","key":"10.1016\/j.cor.2026.107470_b74","doi-asserted-by":"crossref","first-page":"5791","DOI":"10.1080\/00207543.2022.2112989","article-title":"Green smart manufacturing: energy-efficient robotic job shop scheduling models","volume":"61","author":"Wen","year":"2023","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107470_b75","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/TASE.2020.2969469","article-title":"Multiobjective differential evolution algorithm for solving robotic cell scheduling problem with batch-processing machines","volume":"18","author":"Wu","year":"2020","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.cor.2026.107470_b76","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.cor.2018.05.009","article-title":"A dynamic scheduling approach for optimizing the material handling operations in a robotic cell","volume":"99","author":"Yan","year":"2018","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"10.1016\/j.cor.2026.107470_b77","doi-asserted-by":"crossref","first-page":"2823","DOI":"10.1080\/00207543.2011.596999","article-title":"Sequencing and scheduling in a three-machine robotic cell","volume":"50","author":"Zahrouni","year":"2012","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107470_b78","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1016\/j.cor.2012.09.006","article-title":"Two-machine robotic cell scheduling problem with sequence-dependent setup times","volume":"40","author":"Zarandi","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2026.107470_b79","doi-asserted-by":"crossref","first-page":"3831","DOI":"10.1080\/00207543.2018.1513660","article-title":"Auction-based cooperation mechanism for cell part scheduling with transportation capacity constraint","volume":"57","author":"Zeng","year":"2019","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107470_b80","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1080\/00207543.2013.828164","article-title":"A modified shifting bottleneck heuristic and disjunctive graph for job shop scheduling problems with transportation constraints","volume":"52","author":"Zhang","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107470_b81","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110813","article-title":"Multi-objective flexible flow-shop rescheduling with rigid\u2013flexible hybrid constraints and preventive maintenance","volume":"200","author":"Zhao","year":"2025","journal-title":"Comput. Ind. Eng."},{"issue":"8","key":"10.1016\/j.cor.2026.107470_b82","doi-asserted-by":"crossref","first-page":"3621","DOI":"10.1016\/j.apm.2011.10.032","article-title":"A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints","volume":"36","author":"Zhou","year":"2012","journal-title":"Appl. Math. Model."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000882?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000882?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:06:02Z","timestamp":1776114362000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":82,"alternative-id":["S0305054826000882"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107470","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Robotic flow shop scheduling problem with combined buffer conditions","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107470","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":"107470"}}