{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:10:08Z","timestamp":1729613408657,"version":"3.28.0"},"reference-count":105,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T00:00:00Z","timestamp":1723680000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100008314","name":"Athens University of Economics and Business","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008314","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018693","name":"Horizon 2020","doi-asserted-by":"publisher","award":["869951"],"id":[{"id":"10.13039\/100018693","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":[[2025,2]]},"DOI":"10.1016\/j.ejor.2024.08.010","type":"journal-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T21:45:55Z","timestamp":1723499155000},"page":"479-495","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A unified solution framework for flexible job shop scheduling problems with multiple resource constraints"],"prefix":"10.1016","volume":"320","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-5272-9261","authenticated-orcid":false,"given":"Gregory A.","family":"Kasapidis","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7004-3263","authenticated-orcid":false,"given":"Dimitris C.","family":"Paraskevopoulos","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9243-7327","authenticated-orcid":false,"given":"Ioannis","family":"Mourtos","sequence":"additional","affiliation":[]},{"given":"Panagiotis P.","family":"Repoussis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2024.08.010_b1","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108128","article-title":"A new hybridization of adaptive large neighborhood search with constraint programming for open shop scheduling with sequence-dependent setup times","volume":"168","author":"Abreu","year":"2022","journal-title":"Computers & Industrial Engineering"},{"issue":"7","key":"10.1016\/j.ejor.2024.08.010_b2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","article-title":"Extending chip in order to solve complex scheduling and placement problems","volume":"17","author":"Aggoun","year":"1993","journal-title":"Math and Comp. Model."},{"issue":"13","key":"10.1016\/j.ejor.2024.08.010_b3","doi-asserted-by":"crossref","first-page":"3820","DOI":"10.1080\/00207543.2013.831220","article-title":"A job shop scheduling problem with human operators in handicraft production","volume":"52","author":"Agnetis","year":"2014","journal-title":"International Journal of Production Research"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2024.08.010_b4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10479-019-03196-0","article-title":"Scheduling a dual-resource flexible job shop with makespan and due date-related criteria","volume":"291","author":"Andrade-Pineda","year":"2020","journal-title":"Anal. Oper. Res."},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b5","doi-asserted-by":"crossref","first-page":"12490","DOI":"10.1016\/j.ifacol.2017.08.2056","article-title":"An efficient algorithm for scheduling a flexible job shop with blocking and no-wait constraints","volume":"50","author":"Aschauer","year":"2017","journal-title":"IFAC-PapersOnLine"},{"issue":"11","key":"10.1016\/j.ejor.2024.08.010_b6","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1016\/j.ifacol.2018.08.354","article-title":"Scheduling of a flexible job shop with multiple constraints","volume":"51","author":"Aschauer","year":"2018","journal-title":"IFAC-PapersOnLine"},{"issue":"5\u20138","key":"10.1016\/j.ejor.2024.08.010_b7","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/s00170-011-3525-x","article-title":"Lot splitting scheduling procedure for makespan reduction and machine capacity increase in a hybrid flow shop with batch production","volume":"59","author":"Azzi","year":"2012","journal-title":"Int. J. Adv. Manuf. Syst."},{"key":"10.1016\/j.ejor.2024.08.010_b8","first-page":"1","article-title":"Tabu search for the flexible-routing job shop problem","author":"Barnes","year":"1996","journal-title":"The University of Texas, Austin, TX, Technical Report Series ORP96-10, Graduate Program in Operations Research and Industrial Engineering"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b9","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ejor.2023.07.043","article-title":"Hybrid differential evolution algorithm for the resource constrained project scheduling problem with a flexible project structure and consumption and production of resources","volume":"313","author":"van der Beek","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b10","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1016\/j.ejor.2016.08.008","article-title":"Scheduling identical parallel machines with tooling constraints","volume":"257","author":"Beez\u00e3o","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b11","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/j.ejor.2012.06.035","article-title":"Scheduling batches in flowshop with limited buffers in the shampoo industry","volume":"223","author":"Belaid","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"10.1016\/j.ejor.2024.08.010_b12","doi-asserted-by":"crossref","first-page":"2192","DOI":"10.1016\/j.cor.2010.03.009","article-title":"Discrepancy search for the flexible job shop scheduling problem","volume":"37","author":"Ben Hmida","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2024.08.010_b13","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10951-014-0397-6","article-title":"A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing","volume":"19","author":"Bitar","year":"2016","journal-title":"Journal of Scheduling"},{"first-page":"1","year":"1986","series-title":"Scheduling Under Resource Constraints: Deterministic Models","author":"B\u0142a\u017cewicz","key":"10.1016\/j.ejor.2024.08.010_b14"},{"key":"10.1016\/j.ejor.2024.08.010_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104943","article-title":"Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: Application to the permutation flow shop problem","volume":"122","author":"Boufellouh","year":"2020","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by tabu search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Anal. Oper. Res."},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","article-title":"Resource-constrained project scheduling: Notation, classification, models, and methods","volume":"112","author":"Brucker","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b18","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 Spectr."},{"key":"10.1016\/j.ejor.2024.08.010_b19","doi-asserted-by":"crossref","DOI":"10.1007\/BF02238804","article-title":"Job-shop scheduling with multi-purpose machines","author":"Brucker","year":"1990","journal-title":"Computing"},{"issue":"16","key":"10.1016\/j.ejor.2024.08.010_b20","doi-asserted-by":"crossref","first-page":"4854","DOI":"10.1080\/00207543.2015.1126371","article-title":"Open shop scheduling problem with a multi-skills resource constraint: A genetic algorithm and an ant colony optimisation approach","volume":"54","author":"Campos Ciro","year":"2016","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b21","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"The one-machine sequencing problem","volume":"11","author":"Carlier","year":"1982","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b22","first-page":"138","article-title":"Multi-mode resource-constrained project scheduling using modified variable neighborhood search heuristic","volume":"27","author":"Chakrabortty","year":"2020","journal-title":"International Journal of Production Research"},{"issue":"11","key":"10.1016\/j.ejor.2024.08.010_b23","doi-asserted-by":"crossref","first-page":"2071","DOI":"10.1080\/00207540500386012","article-title":"Flexible job-shop scheduling problem under resource constraints","volume":"44","author":"Chan","year":"2006","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2011.03.019","article-title":"Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers","volume":"213","author":"Coelho","year":"2011","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2024.08.010_b25","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/HPCSim.2016.7568414","article-title":"Efficient parallel B&B method for the blocking job shop scheduling problem","author":"Dabah","year":"2016","journal-title":"2016 International Conference on High Performance Computing and Simulation"},{"issue":"24","key":"10.1016\/j.ejor.2024.08.010_b26","doi-asserted-by":"crossref","first-page":"13283","DOI":"10.1007\/s00500-019-03871-1","article-title":"Efficient parallel tabu search for the blocking job shop scheduling problem","volume":"23","author":"Dabah","year":"2019","journal-title":"Soft Computing"},{"key":"10.1016\/j.ejor.2024.08.010_b27","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","article-title":"An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search","volume":"70","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","journal-title":"Anal. Oper. Res."},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b28","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1287\/opre.1060.0358","article-title":"A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem","volume":"55","author":"Debels","year":"2007","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2024.08.010_b29","doi-asserted-by":"crossref","DOI":"10.1145\/141868.141871","article-title":"Performance of various computers using standard linear equations software","author":"Dongarra","year":"1992","journal-title":"ACM SIGARCH Computer Architecture News"},{"key":"10.1016\/j.ejor.2024.08.010_b30","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.cie.2017.01.029","article-title":"Multi-objective algorithms to multi-mode resource-constrained projects under mode change disruption","volume":"106","author":"Elloumi","year":"2017","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b31","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0278-6125(00)80011-4","article-title":"Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms","volume":"19","author":"Elmaraghy","year":"2000","journal-title":"Journal of Manufacturing Systems"},{"issue":"November 2021","key":"10.1016\/j.ejor.2024.08.010_b32","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.jmsy.2022.01.014","article-title":"An improved genetic algorithm for flexible job shop scheduling problem considering reconfigurable machine tools with limited auxiliary modules","volume":"62","author":"Fan","year":"2022","journal-title":"Journal of Manufacturing Systems"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b33","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.ejor.2017.01.002","article-title":"Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources","volume":"260","author":"Fanjul-Peyro","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b34","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.ejor.2013.12.003","article-title":"A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages","volume":"236","author":"Figielska","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2024.08.010_b35","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.cie.2018.09.038","article-title":"Scheduling in a two-stage flowshop with parallel unrelated machines at each stage and shared resources","volume":"126","author":"Figielska","year":"2018","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b36","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1016\/j.ejor.2018.05.056","article-title":"Algorithms for the unrelated parallel machine scheduling problem with a resource constraint","volume":"271","author":"Fleszar","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"10.1016\/j.ejor.2024.08.010_b37","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","article-title":"A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems","volume":"35","author":"Gao","year":"2008","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2024.08.010_b38","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1016\/j.ejor.2022.03.047","article-title":"On the integration of diverging material flows into resource-constrained project scheduling","volume":"303","author":"Gehring","year":"2022","journal-title":"European Journal of Operational Research"},{"year":"1997","series-title":"Tabu Search","author":"Glover","key":"10.1016\/j.ejor.2024.08.010_b39"},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b40","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1016\/j.ejor.2022.09.033","article-title":"Resource-constrained multi-project scheduling problem: A survey","volume":"309","author":"G\u00f3mez S\u00e1nchez","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b41","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejor.2015.02.052","article-title":"Scatter search with path relinking for the flexible job shop scheduling problem","volume":"245","author":"Gonz\u00e1lez","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2024.08.010_b42","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1002\/nav.20095","article-title":"Basic scheduling problems with raw material constraints","volume":"52","author":"Grigoriev","year":"2005","journal-title":"Naval Research Logistics"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b43","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10878-009-9278-x","article-title":"The flexible blocking job shop with transfer and set-up times","volume":"22","author":"Gr\u00f6flin","year":"2011","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b44","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.ejor.2016.09.007","article-title":"Approximation schemes for parallel machine scheduling with non-renewable resources","volume":"258","author":"Gy\u00f6rgyi","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2024.08.010_b45","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.cie.2017.11.016","article-title":"Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut","volume":"115","author":"Gy\u00f6rgyi","year":"2018","journal-title":"Computers & Industrial Engineering"},{"issue":"6","key":"10.1016\/j.ejor.2024.08.010_b46","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/s10951-019-00601-1","article-title":"Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints","volume":"22","author":"Gy\u00f6rgyi","year":"2019","journal-title":"Journal of Scheduling"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b47","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10479-016-2184-6","article-title":"Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources","volume":"248","author":"Hanz\u00e1lek","year":"2017","journal-title":"Anal. Oper. Res."},{"key":"10.1016\/j.ejor.2024.08.010_b48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2021.05.004","article-title":"An updated survey of variants and extensions of the resource-constrained project scheduling problem","volume":"297","author":"Hartmann","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b49","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10951-021-00681-y","article-title":"A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource","volume":"24","author":"Hashimoto","year":"2021","journal-title":"Journal of Scheduling"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b50","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1016\/j.ejor.2020.04.050","article-title":"An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports","volume":"287","author":"Hellsten","year":"2020","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b51","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.ejor.2015.07.001","article-title":"Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints","volume":"248","author":"Herr","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2024.08.010_b52","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.cor.2017.11.011","article-title":"Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints","volume":"92","author":"Hojabri","year":"2018","journal-title":"Computers & Operations Research"},{"issue":"1981","key":"10.1016\/j.ejor.2024.08.010_b53","first-page":"223","article-title":"Tabu search for the job-shop scheduling problem with multi-purpose machines","volume":"225","author":"Hurink","year":"1994","journal-title":"OR Spectr."},{"issue":"11","key":"10.1016\/j.ejor.2024.08.010_b54","doi-asserted-by":"crossref","first-page":"4044","DOI":"10.1111\/poms.13501","article-title":"Flexible job shop scheduling problems with arbitrary precedence graphs","volume":"30","author":"Kasapidis","year":"2021","journal-title":"Prod. Oper. Manag."},{"key":"10.1016\/j.ejor.2024.08.010_b55","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","article-title":"Adaptive large neighborhood search for service technician routing and scheduling problems","volume":"15","author":"Kovacs","year":"2012","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2024.08.010_b56","series-title":"Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems","first-page":"472","volume":"vol. 266","author":"Kreter","year":"2018"},{"key":"10.1016\/j.ejor.2024.08.010_b57","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/s10601-016-9266-6","article-title":"Using constraint programming for solving RCPSP\/max-cal","volume":"22","author":"Kreter","year":"2017","journal-title":"Constraints"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b58","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","article-title":"IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM\/ILOG","volume":"23","author":"Laborie","year":"2018","journal-title":"Constraints"},{"key":"10.1016\/j.ejor.2024.08.010_b59","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.cie.2016.05.016","article-title":"Scheduling operating rooms with consideration of all resources, post anesthesia beds and emergency surgeries","volume":"97","author":"Latorre-N\u00fa\u00f1ez","year":"2016","journal-title":"Computers & Industrial Engineering"},{"year":"1984","series-title":"Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement)","author":"Lawrence","key":"10.1016\/j.ejor.2024.08.010_b60"},{"year":"1998","series-title":"Piecewise Linear Modeling and Analysis","author":"Leenaerts","key":"10.1016\/j.ejor.2024.08.010_b61"},{"issue":"9","key":"10.1016\/j.ejor.2024.08.010_b62","doi-asserted-by":"crossref","first-page":"2519","DOI":"10.1080\/00207543.2013.849822","article-title":"Variable neighbourhood search for dual-resource constrained flexible job shop scheduling","volume":"52","author":"Lei","year":"2014","journal-title":"International Journal of Production Research"},{"issue":"9\u201310","key":"10.1016\/j.ejor.2024.08.010_b63","doi-asserted-by":"crossref","first-page":"2445","DOI":"10.1007\/s00170-020-05850-5","article-title":"Machine learning and optimization for production rescheduling in industry 4.0","volume":"110","author":"Li","year":"2020","journal-title":"Int. J. Adv. Manuf. Syst."},{"key":"10.1016\/j.ejor.2024.08.010_b64","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105585","article-title":"Uniform parallel machine scheduling with fuzzy processing times under resource consumption constraint","volume":"82","author":"Li","year":"2019","journal-title":"Applied Soft Computing"},{"first-page":"462","year":"2020","series-title":"Effective Methods for Integrated Process Planning and Scheduling","author":"Li","key":"10.1016\/j.ejor.2024.08.010_b65"},{"key":"10.1016\/j.ejor.2024.08.010_b66","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.cie.2016.10.012","article-title":"A branch population genetic algorithm for dual-resource constrained job shop scheduling problem","volume":"102","author":"Li","year":"2016","journal-title":"Computers & Industrial Engineering"},{"issue":"9","key":"10.1016\/j.ejor.2024.08.010_b67","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":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2024.08.010_b68","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1016\/j.jclepro.2017.09.037","article-title":"A hybrid fruit fly algorithm for solving flexible job-shop scheduling to reduce manufacturing carbon footprint","volume":"168","author":"Liu","year":"2017","journal-title":"Journal of Cleaner Production"},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b69","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","article-title":"Job-shop scheduling with blocking and no-wait constraints","volume":"143","author":"Mascis","year":"2002","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b70","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","article-title":"Effective neighbourhood functions for the flexible job shop problem","volume":"3","author":"Mastrolilli","year":"2000","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2024.08.010_b71","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijpe.2022.108455","article-title":"Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops","volume":"247","author":"Meloni","year":"2022","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b72","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ejor.2021.02.051","article-title":"Efficient primal heuristic updates for the blocking job shop problem","volume":"295","author":"Mogali","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2024.08.010_b73","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10951-021-00684-9","article-title":"Scheduling for multi-robot routing with blocking and enabling constraints","volume":"24","author":"Mogali","year":"2021","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2024.08.010_b74","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.cor.2015.02.014","article-title":"Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate","volume":"61","author":"Mokhtari","year":"2015","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2024.08.010_b75","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.cor.2018.01.001","article-title":"A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem","volume":"92","author":"Muritiba","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2024.08.010_b76","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.cor.2019.05.009","article-title":"A hybrid differential evolution algorithm with column generation for resource constrained job scheduling","volume":"109","author":"Nguyen","year":"2019","journal-title":"Computers & Operations Research"},{"issue":"October 2018","key":"10.1016\/j.ejor.2024.08.010_b77","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.cie.2019.07.011","article-title":"Production scheduling and lot streaming at flexible job-shops environments using constraint programming","volume":"136","author":"Novas","year":"2019","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"10.1016\/j.ejor.2024.08.010_b78","doi-asserted-by":"crossref","first-page":"2286","DOI":"10.1016\/j.eswa.2013.09.026","article-title":"Integrated scheduling of resource-constrained flexible manufacturing systems using constraint programming","volume":"41","author":"Novas","year":"2014","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2024.08.010_b79","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1609\/icaps.v22i1.13530","article-title":"Iterative improvement algorithms for the blocking job shop","author":"Oddi","year":"2012","journal-title":"ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b80","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/B:ANOR.0000039521.26237.62","article-title":"LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search","volume":"131","author":"Palpant","year":"2004","journal-title":"Anal. Oper. Res."},{"key":"10.1016\/j.ejor.2024.08.010_b81","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(90)90121-Q","article-title":"Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems","volume":"49","author":"Patterson","year":"1990","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"10.1016\/j.ejor.2024.08.010_b82","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2024.08.010_b83","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.ejor.2024.08.010_b84","doi-asserted-by":"crossref","DOI":"10.1016\/j.rico.2023.100350","article-title":"Applications of constraint programming in production scheduling problems: A descriptive bibliometric analysis","volume":"14","author":"Prata","year":"2024","journal-title":"Results in Control and Optimization"},{"key":"10.1016\/j.ejor.2024.08.010_b85","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.asoc.2015.11.034","article-title":"Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling","volume":"40","author":"Rifai","year":"2016","journal-title":"Applied Soft Computing"},{"issue":"4","key":"10.1016\/j.ejor.2024.08.010_b86","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2024.08.010_b87","doi-asserted-by":"crossref","DOI":"10.1007\/s43069-020-00036-x","article-title":"Constraint programming and local search heuristic: A matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports","volume":"1","author":"Sacramento","year":"2020","journal-title":"Oper. Res. Forum"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b88","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","article-title":"Record breaking optimization results using the ruin and recreate principle","volume":"159","author":"Schrimpf","year":"2000","journal-title":"Journal of Computational Physics"},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b89","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1016\/j.ejor.2020.08.057","article-title":"Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties","volume":"290","author":"Sha","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2024.08.010_b90","series-title":"Principles and practice of constraint programming \u2014 CP98","first-page":"417","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"issue":"8","key":"10.1016\/j.ejor.2024.08.010_b91","first-page":"711","article-title":"Two approaches to problems of resource allocation among project activities \u2013 a comparative study","volume":"31","author":"S\u0142owi\u0144ski","year":"1980","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2024.08.010_b92","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0377-2217(81)90348-9","article-title":"Multiobjective network scheduling with efficient use of renewable and nonrenewable resources","volume":"7","author":"S\u0142owi\u0144ski","year":"1981","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b93","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1016\/j.ejor.2020.02.047","article-title":"Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints","volume":"285","author":"Soares","year":"2020","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b94","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/trsc.2021.1109","article-title":"Coordinated delivery to shopping malls with limited docking capacity","volume":"56","author":"Song","year":"2022","journal-title":"Transportation Science"},{"issue":"11","key":"10.1016\/j.ejor.2024.08.010_b95","doi-asserted-by":"crossref","first-page":"2520","DOI":"10.1016\/j.cor.2011.12.022","article-title":"Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems","volume":"39","author":"Trabelsi","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b96","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.cie.2010.08.014","article-title":"Project scheduling under resource constraints: Application of the cumulative global constraint in a decision support framework","volume":"61","author":"Trojet","year":"2011","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"10.1016\/j.ejor.2024.08.010_b97","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.ejor.2013.10.012","article-title":"An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances","volume":"235","author":"Van Peteghem","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b98","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1016\/j.ejor.2016.11.015","article-title":"Decomposition algorithms for synchronous flow shop problems with additional resources and setup times","volume":"259","author":"Waldherr","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"10.1016\/j.ejor.2024.08.010_b99","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1287\/mnsc.27.9.1040","article-title":"Project scheduling with continuously-divisible, doubly constrained resources","volume":"27","author":"W\u0119glarz","year":"1981","journal-title":"Management Sci."},{"issue":"3","key":"10.1016\/j.ejor.2024.08.010_b100","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.cie.2009.04.002","article-title":"A resource-constrained assembly job shop scheduling problem with lot streaming technique","volume":"57","author":"Wong","year":"2009","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"10.1016\/j.ejor.2024.08.010_b101","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1016\/j.cie.2008.09.004","article-title":"Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers","volume":"56","author":"Yaurima","year":"2009","journal-title":"Computers & Industrial Engineering"},{"issue":"7","key":"10.1016\/j.ejor.2024.08.010_b102","doi-asserted-by":"crossref","first-page":"3259","DOI":"10.1016\/j.asoc.2013.02.013","article-title":"A hybrid harmony search algorithm for the flexible job shop scheduling problem","volume":"13","author":"Yuan","year":"2013","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2024.08.010_b103","article-title":"Solving the flexible job shop scheduling and lot streaming problem with setup and transport resource constraints","volume":"10","author":"Yunusoglu","year":"2023","journal-title":"International Journal of Systems Science"},{"issue":"2","key":"10.1016\/j.ejor.2024.08.010_b104","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.engappai.2009.07.002","article-title":"A constraint programming model for the scheduling of flexible manufacturing systems with machine and tool limitations","volume":"23","author":"Zeballos","year":"2010","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"6","key":"10.1016\/j.ejor.2024.08.010_b105","doi-asserted-by":"crossref","DOI":"10.3390\/machines9060108","article-title":"Dual resource constrained flexible job shop scheduling based on improved quantum genetic algorithm","volume":"9","author":"Zhang","year":"2021","journal-title":"Machines"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221724006283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221724006283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:32:56Z","timestamp":1729611176000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221724006283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":105,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["S0377221724006283"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2024.08.010","relation":{},"ISSN":["0377-2217"],"issn-type":[{"type":"print","value":"0377-2217"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A unified solution framework for flexible job shop scheduling problems with multiple resource constraints","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2024.08.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}