{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T23:07:47Z","timestamp":1784243267353,"version":"3.55.0"},"reference-count":88,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002911","name":"Universidad Complutense de Madrid","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002911","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,10]]},"DOI":"10.1016\/j.cor.2026.107566","type":"journal-article","created":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T17:59:37Z","timestamp":1781200777000},"page":"107566","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Job-shop Scheduling Problem with limited input buffers: mathematical models and solution methods"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2476-5898","authenticated-orcid":false,"given":"Huali","family":"Fan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Goh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107566_b1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.asoc.2016.08.037","article-title":"Fast simulated annealing hybridized with quenching for solving job shop scheduling problem","volume":"49","author":"Akram","year":"2016","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.cor.2026.107566_b2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s10033-019-0337-7","article-title":"A modified iterated greedy algorithm for flexible job shop scheduling problem","volume":"32","author":"Al Aqel","year":"2019","journal-title":"Chin. J. Mech. Eng."},{"issue":"1","key":"10.1016\/j.cor.2026.107566_b3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2024.10.026","article-title":"The distributed flow shop scheduling problem with inter-factory transportation","volume":"322","author":"Becker","year":"2025","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107566_b4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","article-title":"The job shop scheduling problem: Conventional and new solution techniques","volume":"93","author":"B\u0142a\u017cewicz","year":"1996","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107566_b5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s00291-005-0008-1","article-title":"Job-shop scheduling with limited capacity buffers","volume":"28","author":"Brucker","year":"2006","journal-title":"OR Spectrum"},{"issue":"12","key":"10.1016\/j.cor.2026.107566_b6","doi-asserted-by":"crossref","first-page":"2317","DOI":"10.1007\/s12541-023-00897-2","article-title":"Research on production scheduling optimization of flexible job shop production with buffer capacity limitation based on the improved gene expression programming algorithm","volume":"24","author":"Chang","year":"2023","journal-title":"Int. J. Precis. Eng. Manuf."},{"key":"10.1016\/j.cor.2026.107566_b7","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.jmsy.2023.08.008","article-title":"Mathematical model and adaptive simulated annealing algorithm for mixed-model assembly job-shop scheduling with lot streaming","volume":"70","author":"Cheng","year":"2023","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cor.2026.107566_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108487","article-title":"Mathematical model and simulated annealing algorithm for setup operator constrained flexible job shop scheduling problem","volume":"171","author":"Defersha","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107566_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2019.103369","article-title":"A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterion","volume":"88","author":"Deng","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cor.2026.107566_b10","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cor.2016.12.021","article-title":"An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem","volume":"81","author":"Dubois-Lacoste","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107566_b11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1504\/EJIE.2008.017685","article-title":"Deadlock-free scheduling of flexible job shops with limited capacity buffers","volume":"2","author":"Fahmy","year":"2008","journal-title":"Eur. J. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107566_b12","article-title":"An integrated approach for hybrid flowshop scheduling with setup times and limited buffers in printed circuit board manufacturing system","author":"Fan","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107566_b13","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.107566_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105401","article-title":"Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints","volume":"134","author":"Fan","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"19","key":"10.1016\/j.cor.2026.107566_b15","doi-asserted-by":"crossref","first-page":"6565","DOI":"10.1080\/00207543.2022.2135629","article-title":"A matheuristic for flexible job shop scheduling problem with lot-streaming and machine reconfigurations","volume":"61","author":"Fan","year":"2023","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107566_b16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","article-title":"Mathematical modeling and heuristic approaches to flexible job shop scheduling problems","volume":"18","author":"Fattahi","year":"2007","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.cor.2026.107566_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121790","article-title":"A tabu memory based iterated greedy algorithm for the distributed heterogeneous permutation flowshop scheduling problem with the total tardiness criterion","volume":"238","author":"Feng","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"10.1016\/j.cor.2026.107566_b18","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1080\/00207543.2014.948578","article-title":"A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem","volume":"53","author":"Fernandez-Viagas","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107566_b19","first-page":"225","article-title":"Probabilistic learning combinations of local job-shop scheduling rules","author":"Fisher","year":"1963","journal-title":"Ind. Sched."},{"key":"10.1016\/j.cor.2026.107566_b20","doi-asserted-by":"crossref","first-page":"165396","DOI":"10.1109\/ACCESS.2020.3022655","article-title":"A hybrid estimation-of-distribution algorithm for scheduling flexible job shop with limited buffers based on Petri nets","volume":"8","author":"Gao","year":"2020","journal-title":"IEEE Access"},{"key":"10.1016\/j.cor.2026.107566_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106508","article-title":"A simulation optimization framework to solve stochastic flexible job-shop scheduling problems\u2014Case: Semiconductor manufacturing","volume":"163","author":"Ghaedy-Heidary","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107566_b22","series-title":"Handbook of Metaheuristics","author":"Glover","year":"2003"},{"issue":"11","key":"10.1016\/j.cor.2026.107566_b23","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1080\/00207540412331330101","article-title":"Optimal scheduling for flexible job shop operation","volume":"43","author":"Gomes","year":"2005","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107566_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2022.101131","article-title":"A two-stage memetic algorithm for energy-efficient flexible job shop scheduling by means of decreasing the total number of machine restarts","volume":"75","author":"Gong","year":"2022","journal-title":"Swarm Evol. Comput."},{"issue":"3-supplement-3","key":"10.1016\/j.cor.2026.107566_b25","doi-asserted-by":"crossref","first-page":"S154","DOI":"10.1287\/opre.46.3.S154","article-title":"Scheduling with finite capacity input buffers","volume":"46","author":"Hall","year":"1998","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107566_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2023.102997","article-title":"Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times","volume":"123","author":"He","year":"2024","journal-title":"Omega"},{"key":"10.1016\/j.cor.2026.107566_b27","series-title":"Job-shop scheduling with limited buffer capacities","author":"Heitmann","year":"2007"},{"issue":"2","key":"10.1016\/j.cor.2026.107566_b28","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","article-title":"Deterministic job-shop scheduling: Past, present and future","volume":"113","author":"Jain","year":"1999","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107566_b29","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1016\/j.ejor.2022.03.054","article-title":"Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem","volume":"304","author":"Karimi-Mamaghan","year":"2023","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107566_b30","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0377-2217(93)E0352-X","article-title":"The scheduling problem where multiple machines compete for a common local buffer","volume":"84","author":"Khosla","year":"1995","journal-title":"European J. Oper. Res."},{"issue":"10","key":"10.1016\/j.cor.2026.107566_b31","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1080\/0305215X.2016.1261247","article-title":"Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups","volume":"49","author":"Kim","year":"2017","journal-title":"Eng. Optim."},{"issue":"10","key":"10.1016\/j.cor.2026.107566_b32","doi-asserted-by":"crossref","first-page":"2956","DOI":"10.1080\/00207543.2018.1518603","article-title":"The two-stage no-wait\/blocking proportionate super shop scheduling problem","volume":"57","author":"Koulamas","year":"2019","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107566_b33","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<125::AID-JOS40>3.0.CO;2-C","article-title":"A large step random walk for minimizing total weighted tardiness in a job shop","volume":"3","author":"Kreipl","year":"2000","journal-title":"J. Sched."},{"key":"10.1016\/j.cor.2026.107566_b34","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.cor.2015.07.011","article-title":"A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective","volume":"66","author":"Kuhpfahl","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107566_b35","article-title":"Resouce constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement)","author":"Lawrence","year":"1984","journal-title":"Grad. Sch. Ind. Adm. Carnegie-Mellon Univ."},{"key":"10.1016\/j.cor.2026.107566_b36","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101580","article-title":"An iterated greedy algorithm with acceleration of job allocation probability for distributed heterogeneous permutation flowshop scheduling problem","volume":"88","author":"Li","year":"2024","journal-title":"Swarm Evol. Comput."},{"issue":"16","key":"10.1016\/j.cor.2026.107566_b37","doi-asserted-by":"crossref","first-page":"5029","DOI":"10.1080\/00207543.2013.790571","article-title":"Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm","volume":"51","author":"Lin","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107566_b38","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."},{"key":"10.1016\/j.cor.2026.107566_b39","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.cor.2016.04.023","article-title":"Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements","volume":"74","author":"Liu","year":"2016","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"10.1016\/j.cor.2026.107566_b40","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."},{"key":"10.1016\/j.cor.2026.107566_b41","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-319-91086-4_5","article-title":"Iterated local search: Framework and applications","author":"Louren\u00e7o","year":"2019","journal-title":"Handb. Metaheuristics"},{"issue":"4","key":"10.1016\/j.cor.2026.107566_b42","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1080\/00207540150504403","article-title":"Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment","volume":"39","author":"Low","year":"2001","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107566_b43","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117555","article-title":"A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop","volume":"204","author":"Lu","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"10.1016\/j.cor.2026.107566_b44","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1080\/0305215X.2023.2198768","article-title":"An improved iterated greedy algorithm for the distributed hybrid flowshop scheduling problem","volume":"56","author":"Lu","year":"2024","journal-title":"Eng. Optim."},{"key":"10.1016\/j.cor.2026.107566_b45","series-title":"Mixed integer linear programming and constraint logic programming: towards a unified modeling framework","author":"Magatao","year":"2005"},{"key":"10.1016\/j.cor.2026.107566_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108366","article-title":"An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan","volume":"171","author":"Miyata","year":"2022","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.cor.2026.107566_b47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2022.08.009","article-title":"A systematic review of multi-objective hybrid flow shop scheduling","volume":"309","author":"Neufeld","year":"2023","journal-title":"European J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107566_b48","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Manag. Sci."},{"key":"10.1016\/j.cor.2026.107566_b49","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105616","article-title":"Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion","volume":"138","author":"\u00d6ztop","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107566_b50","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1007\/s00170-007-1120-y","article-title":"An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion","volume":"38","author":"Pan","year":"2008","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"10.1016\/j.cor.2026.107566_b51","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/322203.322213","article-title":"Flowshop scheduling with limited temporary storage","volume":"27","author":"Papadimitriou","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/j.cor.2026.107566_b52","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"2012"},{"key":"10.1016\/j.cor.2026.107566_b53","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-014-9279-5","article-title":"An iterated greedy metaheuristic for the blocking job shop scheduling problem","volume":"22","author":"Pranzo","year":"2016","journal-title":"J. Heuristics"},{"key":"10.1016\/j.cor.2026.107566_b54","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2019.104839","article-title":"A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion","volume":"117","author":"Riahi","year":"2020","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107566_b55","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","article-title":"An iterated greedy algorithm for the flowshop scheduling problem with blocking","volume":"39","author":"Ribas","year":"2011","journal-title":"Omega"},{"key":"10.1016\/j.cor.2026.107566_b56","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","article-title":"Iterated greedy methods for the distributed permutation flowshop scheduling problem","volume":"83","author":"Ruiz","year":"2019","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.cor.2026.107566_b57","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","article-title":"A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem","volume":"177","author":"Ruiz","year":"2007","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107566_b58","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","article-title":"An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives","volume":"187","author":"Ruiz","year":"2008","journal-title":"European J. Oper. Res."},{"issue":"13","key":"10.1016\/j.cor.2026.107566_b59","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0895-7177(00)00110-2","article-title":"Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers","volume":"31","author":"Sawik","year":"2000","journal-title":"Math. Comput. Modelling"},{"issue":"4\u20135","key":"10.1016\/j.cor.2026.107566_b60","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0895-7177(02)00176-0","article-title":"An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers","volume":"36","author":"Sawik","year":"2002","journal-title":"Math. Comput. Modelling"},{"key":"10.1016\/j.cor.2026.107566_b61","doi-asserted-by":"crossref","first-page":"1739","DOI":"10.1007\/s00170-014-6343-0","article-title":"Cyclic hybrid flow shop scheduling problem with limited buffers and machine eligibility constraints","volume":"76","author":"Soltani","year":"2015","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.cor.2026.107566_b62","series-title":"Applying Iterated Local Search to the Permutation Flow Shop Problem","author":"St\u00fctzle","year":"1998"},{"key":"10.1016\/j.cor.2026.107566_b63","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/978-3-319-07124-4_10","article-title":"Iterated greedy.","author":"St\u00fctzle","year":"2018","journal-title":"Handb. Heuristics"},{"issue":"2","key":"10.1016\/j.cor.2026.107566_b64","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":"3","key":"10.1016\/j.cor.2026.107566_b65","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1057\/palgrave.jors.2602033","article-title":"Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers","volume":"57","author":"Tang","year":"2006","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"10.1016\/j.cor.2026.107566_b66","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/TEVC.2024.3443874","article-title":"An iterated greedy algorithm with reinforcement learning for distributed hybrid flowshop problems with job merging","volume":"29","author":"Tao","year":"2024","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107566_b67","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s12559-018-9595-4","article-title":"Extracting new dispatching rules for multi-objective dynamic flexible job shop scheduling with limited buffer spaces","volume":"12","author":"Teymourifar","year":"2020","journal-title":"Cogn. Comput."},{"key":"10.1016\/j.cor.2026.107566_b68","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106222","article-title":"A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting","volume":"155","author":"Tutumlu","year":"2023","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107566_b69","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1016\/j.ejor.2010.05.041","article-title":"Shifting representation search for hybrid flexible flowline problems","volume":"207","author":"Urlings","year":"2010","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107566_b70","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","author":"Van Laarhoven","year":"1992","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107566_b71","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/s10696-022-09446-x","article-title":"A multi-objective mathematical model and evolutionary algorithm for the dual-resource flexible job-shop scheduling problem with sequencing flexibility","volume":"35","author":"Vital-Soto","year":"2023","journal-title":"Flex. Serv. Manuf. J."},{"key":"10.1016\/j.cor.2026.107566_b72","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2023.101320","article-title":"A cooperative iterated greedy algorithm for the distributed flowshop group robust scheduling problem with uncertain processing times","volume":"79","author":"Wang","year":"2023","journal-title":"Swarm Evol. Comput."},{"issue":"11","key":"10.1016\/j.cor.2026.107566_b73","doi-asserted-by":"crossref","first-page":"2453","DOI":"10.3390\/math11112453","article-title":"A variant iterated greedy algorithm integrating multiple decoding rules for hybrid blocking flow shop scheduling problem","volume":"11","author":"Wang","year":"2023","journal-title":"Mathematics"},{"key":"10.1016\/j.cor.2026.107566_b74","series-title":"International Heinz Nixdorf Symposium","first-page":"295","article-title":"Job shop scheduling with buffer constraints and jobs consuming variable buffer space","author":"Witt","year":"2010"},{"key":"10.1016\/j.cor.2026.107566_b75","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108236","article-title":"An improved multi-objective evolutionary algorithm based on decomposition for solving re-entrant hybrid flow shop scheduling problem with batch processing machines","volume":"169","author":"Wu","year":"2022","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.cor.2026.107566_b76","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ejor.2016.07.030","article-title":"A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints","volume":"257","author":"Xiong","year":"2017","journal-title":"European J. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107566_b77","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3390\/a14050145","article-title":"No-wait job shop scheduling using a population-based iterated greedy algorithm","volume":"14","author":"Xu","year":"2021","journal-title":"Algorithms"},{"key":"10.1016\/j.cor.2026.107566_b78","doi-asserted-by":"crossref","first-page":"7449","DOI":"10.1109\/TASE.2024.3356255","article-title":"A novel mathematical model for the flexible job-shop scheduling problem with limited automated guided vehicles","volume":"22","author":"Yao","year":"2024","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.cor.2026.107566_b79","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2022.102506","article-title":"A novel MILP model for job shop scheduling problem with mobile robots","volume":"81","author":"Yao","year":"2023","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107566_b80","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2026.107437","article-title":"A population-based and Q-learning-cooperative iterated greedy algorithm for distributed no-wait job shop problem","author":"Yin","year":"2026","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107566_b81","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122434","article-title":"Mathematical model and knowledge-based iterated greedy algorithm for distributed assembly hybrid flow shop scheduling problem with dual-resource constraints","volume":"239","author":"Yu","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107566_b82","article-title":"Scheduling of a job-shop problem with limited output buffers","author":"Zeng","year":"2019","journal-title":"Eng. Optim."},{"issue":"11","key":"10.1016\/j.cor.2026.107566_b83","doi-asserted-by":"crossref","first-page":"12112","DOI":"10.1109\/TCYB.2021.3081805","article-title":"A hybrid artificial immune-simulated annealing algorithm for multiroute job shop scheduling problem with continuous limited output buffers","volume":"52","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Cybern."},{"issue":"5","key":"10.1016\/j.cor.2026.107566_b84","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1016\/j.cor.2010.09.014","article-title":"A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective","volume":"38","author":"Zhang","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107566_b85","article-title":"An iterative greedy algorithm for solving a multiobjective distributed assembly flexible job shop scheduling problem with fuzzy processing time","author":"Zhao","year":"2025","journal-title":"IEEE Trans. Cybern."},{"issue":"5","key":"10.1016\/j.cor.2026.107566_b86","doi-asserted-by":"crossref","first-page":"3207","DOI":"10.1109\/TSMC.2024.3358383","article-title":"An iterative greedy algorithm with Q-learning mechanism for the multiobjective distributed no-idle permutation flowshop scheduling","volume":"54","author":"Zhao","year":"2024","journal-title":"IEEE Trans. Syst. Man, Cybern.: Syst."},{"key":"10.1016\/j.cor.2026.107566_b87","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104503","article-title":"An effective hybrid meta-heuristic for flexible flow shop scheduling with limited buffers and step-deteriorating jobs","volume":"106","author":"Zheng","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"10.1016\/j.cor.2026.107566_b88","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/s40747-023-01147-8","article-title":"A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers","volume":"10","author":"Zheng","year":"2024","journal-title":"Complex Intell. Syst."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505482600184X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505482600184X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:21:28Z","timestamp":1784240488000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505482600184X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":88,"alternative-id":["S030505482600184X"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107566","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Job-shop Scheduling Problem with limited input buffers: mathematical models and solution methods","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107566","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":"107566"}}