{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:51:15Z","timestamp":1777956675167,"version":"3.51.4"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.cie.2026.111948","type":"journal-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:56:12Z","timestamp":1772643372000},"page":"111948","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A GRASPxVNS approach for the flexible job shop scheduling with generic minimal time lags"],"prefix":"10.1016","volume":"216","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1129-9170","authenticated-orcid":false,"given":"Soufiane","family":"Aallaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6360-2162","authenticated-orcid":false,"given":"Ahlam","family":"Azzamouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Libo","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7288-1076","authenticated-orcid":false,"given":"Nikolay","family":"Tchernev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cie.2026.111948_b0005","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","article-title":"The third comprehensive survey on scheduling problems with setup times\/costs","volume":"246","author":"Allahverdi","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111948_b0010","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.ejor.2004.04.020","article-title":"A heuristic to schedule flexible job-shop in a glass factory","volume":"165","author":"Alvarez-Valdes","year":"2005","journal-title":"European Journal of Operational Research, Project Management and Scheduling"},{"key":"10.1016\/j.cie.2026.111948_b0015","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"},{"key":"10.1016\/j.cie.2026.111948_b0020","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01719250","article-title":"A generalized permutation approach to job shop scheduling with genetic algorithms","volume":"17","author":"Bierwirth","year":"1995","journal-title":"Operations Research Spektrum"},{"key":"10.1016\/j.cie.2026.111948_b0025","unstructured":"Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C., 2000. A greedy randomized adaptive search procedure for job shop scheduling. Essays and Surveys in Metaheuristics, ATT Labs Research Technical Report."},{"key":"10.1016\/j.cie.2026.111948_b0030","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.ejor.2015.06.023","article-title":"List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility","volume":"247","author":"Birgin","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111948_b0035","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1080\/17480930.2018.1448248","article-title":"Short-term planning for open pit mines: A review","volume":"33","author":"Blom","year":"2019","journal-title":"International Journal of Mining, Reclamation and Environment"},{"key":"10.1016\/j.cie.2026.111948_b0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107542","article-title":"The generalized flexible job shop scheduling problem","volume":"160","author":"Boyer","year":"2021","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2026.111948_b0045","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":"Annals of Operations Research"},{"key":"10.1016\/j.cie.2026.111948_b0050","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1057\/s41274-017-0239-y","article-title":"Real-world flexible resource profile scheduling with multiple criteria: Learning scalarization functions for MIP and heuristic approaches","volume":"68","author":"Braune","year":"2017","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.cie.2026.111948_b0055","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","article-title":"Job-shop scheduling with multi-purpose machines","volume":"45","author":"Brucker","year":"1990","journal-title":"Computing"},{"key":"10.1016\/j.cie.2026.111948_b0060","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/09537287.2013.782846","article-title":"A dispatching algorithm for flexible job-shop scheduling with transfer batches: An industrial application","volume":"25","author":"Calleja","year":"2014","journal-title":"Production Planning & Control"},{"key":"10.1016\/j.cie.2026.111948_b0065","doi-asserted-by":"crossref","first-page":"2331","DOI":"10.1016\/j.cor.2006.11.007","article-title":"A memetic algorithm for the job-shop with time-lags","volume":"35","author":"Caumond","year":"2008","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.cie.2026.111948_b0070","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1111\/itor.12199","article-title":"A research survey: Review of flexible job shop scheduling techniques","volume":"23","author":"Chaudhry","year":"2016","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.cie.2026.111948_b0075","doi-asserted-by":"crossref","unstructured":"Cinar, D., Topcu, Y.I., Oliveira, J.A., 2015. A Taxonomy for the Flexible Job Shop Scheduling Problem, in: Migdalas, A., Karakitsiou, A. (Eds.), Optimization, Control, and Applications in the Information Age, Springer Proceedings in Mathematics & Statistics. Springer International Publishing, Cham, pp. 17\u201337. https:\/\/doi.org\/10.1007\/978-3-319-18567-5_2.","DOI":"10.1007\/978-3-319-18567-5_2"},{"key":"10.1016\/j.cie.2026.111948_b0080","article-title":"The flexible job shop scheduling problem: A review","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111948_b0085","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":"Ann. Oper. Res."},{"key":"10.1016\/j.cie.2026.111948_b0090","doi-asserted-by":"crossref","first-page":"2331","DOI":"10.1080\/00207543.2011.574952","article-title":"Jobshop lot streaming with routing flexibility, sequence-dependent setups, machine release dates and lag time","volume":"50","author":"Defersha","year":"2012","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2026.111948_b0095","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1287\/opre.44.5.777","article-title":"Shop problems with two machines and time lags","volume":"44","author":"Dell\u2019Amico","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/j.cie.2026.111948_b0100","unstructured":"Dongarra, J.J., 2013. Performance of Various Computers Using Standard Linear Equations Software (Technical report). Computer Science Department.University of Tennessee, Knoxville,Tennessee."},{"key":"10.1016\/j.cie.2026.111948_b0105","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1002\/cpe.728","article-title":"The LINPACK Benchmark: Past, present and future","volume":"15","author":"Dongarra","year":"2003","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"10.1016\/j.cie.2026.111948_b0110","series-title":"Proceedings of the Sixth International Symposium on Micro Machine and Human Science. Presented at the MHS\u201995. Proceedings of the Sixth International Symposium on Micro Machine and Human Science","first-page":"39","article-title":"A new optimizer using particle swarm theory, in: MHS\u201995","author":"Eberhart","year":"1995"},{"key":"10.1016\/j.cie.2026.111948_b0115","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":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/j.cie.2026.111948_b0120","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.cie.2026.111948_b0125","first-page":"168","article-title":"Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times","volume":"112","author":"Fondrevelle","year":"2008","journal-title":"International Journal of Production Economics, Special Section on Recent Developments in the Design, Control, Planning and Scheduling of Productive Systems"},{"key":"10.1016\/j.cie.2026.111948_b0130","doi-asserted-by":"crossref","first-page":"1540","DOI":"10.1016\/j.cor.2004.11.006","article-title":"Permutation flowshop scheduling problems with maximal and minimal time lags","volume":"33","author":"Fondrevelle","year":"2006","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2026.111948_b0135","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, Part Special Issue: Bio-inspired Methods in Combinatorial Optimization"},{"key":"10.1016\/j.cie.2026.111948_b0140","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The Complexity of Flowshop and Jobshop Scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.cie.2026.111948_b0145","first-page":"533","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers & Operations Research, Applications of Integer Programming"},{"key":"10.1016\/j.cie.2026.111948_b0150","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":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2026.111948_b0155","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"},{"key":"10.1016\/j.cie.2026.111948_b0160","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","article-title":"A block approach for single-machine scheduling with release dates and due dates","volume":"26","author":"Grabowski","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111948_b0165","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s00186-013-0456-3","article-title":"Flexible job shop scheduling with blockages","volume":"79","author":"Hansmann","year":"2014","journal-title":"Mathematical Methods of Operations Research"},{"key":"10.1016\/j.cie.2026.111948_b0170","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","article-title":"Tabu search for the job-shop scheduling problem with multi-purpose machines","volume":"15","author":"Hurink","year":"1994","journal-title":"Operations Research Spektrum"},{"key":"10.1016\/j.cie.2026.111948_b0175","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.cor.2014.01.010","article-title":"Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem","volume":"47","author":"Jia","year":"2014","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2026.111948_b0180","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.engappai.2017.04.002","article-title":"An effective multi-start multi-level evolutionary local search for the flexible job-shop problem","volume":"62","author":"Kemmo\u00e9-Tchomt\u00e9","year":"2017","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.cie.2026.111948_b0185","doi-asserted-by":"crossref","unstructured":"Lacomme, P., Tchernev, N., Huguet, M.J., 2011. Dedicated constraint propagation for Job-Shop problem with generic time-lags, in: ETFA2011. Presented at the ETFA2011, pp. 1\u20137. https:\/\/doi.org\/10.1109\/ETFA.2011.6059042.","DOI":"10.1109\/ETFA.2011.6059042"},{"key":"10.1016\/j.cie.2026.111948_b0190","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1080\/00207543.2011.561375","article-title":"Flexible job-shop scheduling problems with \u2018AND\u2019\/\u2018OR\u2019 precedence constraints","volume":"50","author":"Lee","year":"2012","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2026.111948_b0195","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem","volume":"174","author":"Li","year":"2016","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.cie.2026.111948_b0200","doi-asserted-by":"crossref","unstructured":"Mati, Y., Rezg, N., Xie, X., 2001. An integrated greedy heuristic for a flexible job shop scheduling problem, in: 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236). Presented at the 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236), pp. 2534\u20132539 vol.4. https:\/\/doi.org\/10.1109\/ICSMC.2001.972939.","DOI":"10.1109\/ICSMC.2001.972939"},{"key":"10.1016\/j.cie.2026.111948_b0205","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2026.111948_b0210","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":"M\u00f6nch","year":"2011","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.cie.2026.111948_b0215","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/17480930601118947","article-title":"Long-term open pit mine production planning: A review of models and algorithms","volume":"22","author":"Osanloo","year":"2008","journal-title":"International Journal of Mining, Reclamation and Environment"},{"key":"10.1016\/j.cie.2026.111948_b0220","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.cor.2014.08.023","article-title":"Genetic tabu search for the fuzzy flexible job shop problem","volume":"54","author":"Palacios","year":"2015","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2026.111948_b0225","doi-asserted-by":"crossref","first-page":"2409","DOI":"10.1080\/00207541003709544","article-title":"A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints","volume":"49","author":"Rajkumar","year":"2011","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2026.111948_b0230","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.rcim.2006.06.004","article-title":"Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method","volume":"23","author":"Rossi","year":"2007","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"10.1016\/j.cie.2026.111948_b0235","unstructured":"Roy, B., Sussmann, B., 1964. Roy, B. and Sussmann, B. (1964) Les Problemes d\u2019 Ordon Ordonnancement Avec Constraints Disjunctives. SEMA, Note D.S., Paris. - References - Scientific Research Publishing [WWW Document]. URL https:\/\/www.scirp.org\/(S(351jmbntvnsjt1aadkposzje))\/reference\/referencespapers.aspx?referenceid=1201138 (accessed 10.8.22)."},{"key":"10.1016\/j.cie.2026.111948_b0240","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1018955929512","article-title":"Practical job shop scheduling","volume":"83","author":"Schutten","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.cie.2026.111948_b0245","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/B:JIMS.0000010078.30713.e9","article-title":"Tardiness minimization in a flexible job shop: A tabu search approach","volume":"15","author":"Scrich","year":"2004","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/j.cie.2026.111948_b0250","doi-asserted-by":"crossref","first-page":"3027","DOI":"10.1080\/00207540600988105","article-title":"A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem","volume":"46","author":"Shi-Jin","year":"2008","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2026.111948_b0255","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2019.100632","article-title":"Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm","volume":"53","author":"Soto","year":"2020","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.cie.2026.111948_b0260","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ejor.2021.03.069","article-title":"Multiobjective optimization for complex flexible job-shop scheduling problems","volume":"296","author":"Tamssaouet","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111948_b0265","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/j.cie.2010.05.016","article-title":"An effective heuristic for flexible job-shop scheduling problem with maintenance activities","volume":"59","author":"Wang","year":"2010","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2026.111948_b0270","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1049\/iet-cim.2018.0009","article-title":"Review on flexible job shop scheduling","volume":"1","author":"Xie","year":"2019","journal-title":"IET Collaborative Intelligent Manufacturing"},{"key":"10.1016\/j.cie.2026.111948_b0275","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/j.eswa.2009.06.007","article-title":"Flexible job-shop scheduling with parallel variable neighborhood search algorithm","volume":"37","author":"Yazdani","year":"2010","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.cie.2026.111948_b0280","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.cie.2013.02.022","article-title":"Flexible job shop scheduling using hybrid differential evolution algorithms","volume":"65","author":"Yuan","year":"2013","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2026.111948_b0285","doi-asserted-by":"crossref","first-page":"11561","DOI":"10.1007\/s10586-017-1420-4","article-title":"A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem","volume":"22","author":"Zhang","year":"2019","journal-title":"Cluster Comput"},{"key":"10.1016\/j.cie.2026.111948_b0290","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.ejor.2019.11.016","article-title":"Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system","volume":"283","author":"Zhang","year":"2020","journal-title":"European Journal of Operational Research"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S036083522600149X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S036083522600149X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T03:28:15Z","timestamp":1777951695000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S036083522600149X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":58,"alternative-id":["S036083522600149X"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2026.111948","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A GRASPxVNS approach for the flexible job shop scheduling with generic minimal time lags","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2026.111948","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":"111948"}}