{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:35:21Z","timestamp":1776976521649,"version":"3.51.4"},"reference-count":63,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52275489"],"award-info":[{"award-number":["52275489"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2021YFB3301902"],"award-info":[{"award-number":["2021YFB3301902"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Program on Key Basic Research Project","award":["52275489"],"award-info":[{"award-number":["52275489"]}]},{"name":"National Program on Key Basic Research Project","award":["2021YFB3301902"],"award-info":[{"award-number":["2021YFB3301902"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>In today\u2019s customer-centric economy, the demand for personalized products has compelled corporations to develop manufacturing processes that are more flexible, efficient, and cost-effective. Flexible job shops offer organizations the agility and cost-efficiency that traditional manufacturing processes lack. However, the dynamics of modern manufacturing, including machine breakdown and new order arrivals, introduce unpredictability and complexity. This study investigates the multiplicity dynamic flexible job shop scheduling problem (MDFJSP) with new order arrivals. To address this problem, we incorporate the fluid model to propose a fluid randomized adaptive search (FRAS) algorithm, comprising a construction phase and a local search phase. Firstly, in the construction phase, a fluid construction heuristic with an online fluid dynamic tracking policy generates high-quality initial solutions. Secondly, in the local search phase, we employ an improved tabu search procedure to enhance search efficiency in the solution space, incorporating symmetry considerations. The results of the numerical experiments demonstrate the superior effectiveness of the FRAS algorithm in solving the MDFJSP when compared to other algorithms. Specifically, the proposed algorithm demonstrates a superior quality of solution relative to existing algorithms, with an average improvement of 29.90%; and exhibits an acceleration in solution speed, with an average increase of 1.95%.<\/jats:p>","DOI":"10.3390\/sym16060641","type":"journal-article","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T10:00:11Z","timestamp":1716372011000},"page":"641","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An Adaptive Search Algorithm for Multiplicity Dynamic Flexible Job Shop Scheduling with New Order Arrivals"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4105-8183","authenticated-orcid":false,"given":"Linshan","family":"Ding","sequence":"first","affiliation":[{"name":"School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China"}]},{"given":"Zailin","family":"Guan","sequence":"additional","affiliation":[{"name":"School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2053-2242","authenticated-orcid":false,"given":"Dan","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2325-9512","authenticated-orcid":false,"given":"Mudassar","family":"Rauf","sequence":"additional","affiliation":[{"name":"College of Mechanical and Electrical Engineering, Wenzhou University, Wenzhou 325060, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9105-4191","authenticated-orcid":false,"given":"Weikang","family":"Fang","sequence":"additional","affiliation":[{"name":"School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China"}]}],"member":"1968","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"7572","DOI":"10.1080\/00207543.2021.2013565","article-title":"Mass-Individualisation\u2013the twenty first century manufacturing paradigm","volume":"60","author":"Gu","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.jmsy.2024.02.010","article-title":"Unlocking the power of industrial artificial intelligence towards Industry 5.0: Insights, pathways, and challenges","volume":"73","author":"Leng","year":"2024","journal-title":"J. Manuf. Syst."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Basantes Montero, D.T., Rea Minango, S.N., Barzallo N\u00fa\u00f1ez, D.I., Eibar Bejarano, C.G., and Proa\u00f1o L\u00f3pez, P.D. (2021, January 1\u20133). Flexible Manufacturing System Oriented to Industry 4.0. Proceedings of the Innovation and Research: A Driving Force for Socio-Econo-Technological Development 1st, Sangolqu\u00ed, Ecuador.","DOI":"10.1007\/978-3-030-60467-7_20"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1007\/s10796-020-10047-y","article-title":"Industry 4.0 technologies in flexible manufacturing for sustainable organizational value: Reflections from a multiple case study of Italian manufacturers","volume":"25","author":"Margherita","year":"2023","journal-title":"Inf. Syst. Front."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"101676","DOI":"10.1016\/j.aei.2022.101676","article-title":"Digital twins-based flexible operating of open architecture production line for individualized manufacturing","volume":"53","author":"Leng","year":"2022","journal-title":"Adv. Eng. Inform."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"109178","DOI":"10.1016\/j.cie.2023.109178","article-title":"Individualized requirement-driven multi-task scheduling in cloud manufacturing using an extended multifactorial evolutionary algorithm","volume":"179","author":"Zhang","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"105031","DOI":"10.1016\/j.cor.2020.105031","article-title":"Real-time production scheduling in the Industry-4.0 context: Addressing uncertainties in job arrivals and machine breakdowns","volume":"123","author":"Ghaleb","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"6602","DOI":"10.1080\/00207543.2022.2122622","article-title":"A state-of-the-art on production planning in Industry 4.0","volume":"61","author":"Luo","year":"2023","journal-title":"Int. J. Prod. Res."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Sangaiah, A.K., Suraki, M.Y., Sadeghilalimi, M., Bozorgi, S.M., Hosseinabadi, A.A.R., and Wang, J. (2019). A new meta-heuristic algorithm for solving the flexible dynamic job-shop problem with parallel machines. Symmetry, 11.","DOI":"10.3390\/sym11020165"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.jmsy.2023.11.010","article-title":"Multirobot collaborative task dynamic scheduling based on multiagent reinforcement learning with heuristic graph convolution considering robot service performance","volume":"72","author":"Zhou","year":"2024","journal-title":"J. Manuf. Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"101538","DOI":"10.1016\/j.swevo.2024.101538","article-title":"A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV","volume":"86","author":"Han","year":"2024","journal-title":"Swarm. Evol. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A genetic algorithm for the Flexible Job-shop Scheduling Problem","volume":"35","author":"Pezzella","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"109255","DOI":"10.1016\/j.cie.2023.109255","article-title":"Dynamic scheduling for flexible job shop using a deep reinforcement learning approach","volume":"180","author":"Gui","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.compind.2015.10.001","article-title":"Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization","volume":"81","author":"Tang","year":"2016","journal-title":"Comput. Ind."},{"key":"ref_15","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":"Monch","year":"2011","journal-title":"J. Sched."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"012029","DOI":"10.1088\/1757-899X\/885\/1\/012029","article-title":"Production capacity planning in motorcycle assembly line using CRP method at PT XYZ","volume":"Volume 885","author":"Purba","year":"2020","journal-title":"Proceedings of the IOP Conference Series: Materials Science and Engineering"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1742","DOI":"10.1080\/0305215X.2022.2124406","article-title":"Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing","volume":"55","author":"Han","year":"2023","journal-title":"Eng. Optim."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1109\/TCYB.2020.3024849","article-title":"Evolving scheduling heuristics via genetic programming with feature selection in dynamic flexible job-shop scheduling","volume":"51","author":"Zhang","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"121723","DOI":"10.1016\/j.eswa.2023.121723","article-title":"A DQL-NSGA-III algorithm for solving the flexible job shop dynamic scheduling problem","volume":"237","author":"Tang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10845-022-02037-5","article-title":"Multi-agent reinforcement learning based on graph convolutional network for flexible job shop scheduling","volume":"35","author":"Jing","year":"2024","journal-title":"J. Intell. Manuf."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1080\/0305215X.2022.2145605","article-title":"A hybrid fluid master\u2013apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time","volume":"56","author":"Ding","year":"2024","journal-title":"Eng. Optim."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"101550","DOI":"10.1016\/j.swevo.2024.101550","article-title":"Multi-policy deep reinforcement learning for multi-objective multiplicity flexible job shop scheduling","volume":"87","author":"Ding","year":"2024","journal-title":"Swarm. Evol. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cie.2011.09.002","article-title":"Decomposition-based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system","volume":"62","author":"Guo","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.cie.2016.03.011","article-title":"Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem","volume":"96","author":"Kundakci","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Lei, D., Zhang, J., and Liu, H. (2024). An Adaptive Two-Class Teaching-Learning-Based Optimization for Energy-Efficient Hybrid Flow Shop Scheduling Problems with Additional Resources. Symmetry, 16.","DOI":"10.3390\/sym16020203"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"107917","DOI":"10.1016\/j.engappai.2024.107917","article-title":"Multi-objective adaptive large neighbourhood search algorithm for dynamic flexible job shop schedule problem with transportation resource","volume":"132","author":"Liu","year":"2024","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1080\/00207543.2019.1597291","article-title":"A column generation-based approach for proportionate flexible two-stage no-wait job shop scheduling","volume":"58","author":"Pei","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1007\/s001700070029","article-title":"Job shop scheduling with dynamic fuzzy selection of dispatching rules","volume":"16","author":"Subramaniam","year":"2000","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2759","DOI":"10.1007\/s10845-018-1421-z","article-title":"A semantics-based dispatching rule selection approach for job shop scheduling","volume":"30","author":"Zhang","year":"2019","journal-title":"J. Intell. Manuf."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1109\/TEVC.2021.3056143","article-title":"Correlation Coefficient-Based Recombinative Guidance for Genetic Programming Hyperheuristics in Dynamic Flexible Job Shop Scheduling","volume":"25","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"101649","DOI":"10.1016\/j.jocs.2022.101649","article-title":"Selection of dispatching rules evolved by genetic programming in dynamic unrelated machines scheduling based on problem characteristics","volume":"61","year":"2022","journal-title":"J. Comput. Sci."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1080\/095372800232379","article-title":"Efficient jobshop dispatching rules: Further developments","volume":"11","author":"Holthaus","year":"2010","journal-title":"Prod. Plan. Control"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"5675","DOI":"10.1080\/00207543.2021.1968526","article-title":"Joint optimisation for dynamic flexible job-shop scheduling problem with transportation time and resource constraints","volume":"60","author":"Ren","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Fuladi, S.K., and Kim, C.S. (2024). Dynamic Events in the Flexible Job-Shop Scheduling Problem: Rescheduling with a Hybrid Metaheuristic Algorithm. Algorithms, 17.","DOI":"10.3390\/a17040142"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1080\/0305215X.2022.2098283","article-title":"An improved hybrid metaheuristics and rule-based approach for flexible job-shop scheduling subject to machine breakdowns","volume":"55","author":"Thi","year":"2023","journal-title":"Eng. Optim."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.jmsy.2024.03.009","article-title":"An improved genetic programming hyper-heuristic for the dynamic flexible job shop scheduling problem with reconfigurable manufacturing cells","volume":"74","author":"Guo","year":"2024","journal-title":"J. Manuf. Syst."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.promfg.2019.02.006","article-title":"A Review of Dynamic Job Shop Scheduling Techniques","volume":"30","author":"Mohan","year":"2019","journal-title":"Procedia Manuf."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.jmsy.2020.06.005","article-title":"Greedy randomized adaptive search for dynamic flexible job-shop scheduling","volume":"56","year":"2020","journal-title":"J. Manuf. Syst."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Zhang, H., Buchmeister, B., Li, X., and Ojstersek, R. (2023). An Efficient Metaheuristic Algorithm for Job Shop Scheduling in a Dynamic Environment. Mathematics, 11.","DOI":"10.3390\/math11102336"},{"key":"ref_40","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 Collab. Intell. Manuf."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"1104","DOI":"10.1287\/opre.41.6.1104","article-title":"Dynamic Scheduling of a Multiclass Fluid Network","volume":"41","author":"Chen","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.50.4.692.2860","article-title":"A fluid heuristic for minimizing makespan in job shops","volume":"50","author":"Dai","year":"2002","journal-title":"Oper. Res."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.51.5.798.16748","article-title":"From fluid relaxations to practical algorithms for high-multiplicity job-shop scheduling: The holding cost objective","volume":"51","author":"Bertsimas","year":"2003","journal-title":"Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10951-014-0376-y","article-title":"Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem","volume":"17","author":"Masin","year":"2014","journal-title":"J. Sched."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/s10878-018-0294-6","article-title":"Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan","volume":"36","author":"Gu","year":"2018","journal-title":"J. Comb. Optim."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1109\/TAC.2014.2352711","article-title":"Robust Fluid Processing Networks","volume":"60","author":"Bertsimas","year":"2015","journal-title":"IEEE Trans. Autom. Control"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1006\/jagm.1999.1047","article-title":"Asymptotically optimal algorithms for job shop scheduling and packet routing","volume":"33","author":"Bertsimas","year":"1999","journal-title":"J. Algorithms"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s101070100272","article-title":"From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective","volume":"92","author":"Bertsimas","year":"2002","journal-title":"Math. Program."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10951-010-0174-0","article-title":"A fluid approach to large volume job shop scheduling","volume":"13","author":"Nazarathy","year":"2010","journal-title":"J. Sched."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/jos.72","article-title":"Scheduling jobshops with some identical or similar jobs","volume":"4","author":"Boudoukh","year":"2001","journal-title":"J. Sched."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.ins.2014.11.036","article-title":"Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems","volume":"298","author":"Shen","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00170-006-0836-4","article-title":"Dynamic job-shop scheduling with sequence-dependent setup times: Simulation modeling and analysis","volume":"36","author":"Vinod","year":"2008","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search-part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","article-title":"An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems","volume":"59","author":"Li","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"ref_55","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":"Vela","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_56","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":"Lamy","year":"2017","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.ins.2014.10.042","article-title":"Metaheuristics in large-scale global continues optimization: A survey","volume":"295","author":"Mandavi","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Chen, R.H., Yang, B., Li, S., and Wang, S.L. (2020). A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput. Ind. Eng., 149.","DOI":"10.1016\/j.cie.2020.106778"},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Defersha, F.M., and Rooyani, D. (2020). An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached\/detached setup, machine release date and lag-time. Comput. Ind. Eng., 147.","DOI":"10.1016\/j.cie.2020.106605"},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Resende","year":"1995","journal-title":"J. Glob. Optim."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","article-title":"A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: A case study on the CEC\u20192005 special session on real parameter optimization","volume":"15","author":"Molina","year":"2009","journal-title":"J. Heuristics"},{"key":"ref_62","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":"Ann. Oper. Res."},{"key":"ref_63","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":"J. Sched."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/6\/641\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:46:28Z","timestamp":1760107588000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/6\/641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,22]]},"references-count":63,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["sym16060641"],"URL":"https:\/\/doi.org\/10.3390\/sym16060641","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,22]]}}}