{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T19:28:02Z","timestamp":1777663682208,"version":"3.51.4"},"reference-count":39,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"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":["(61772454, 61811530332, 61811540410)"],"award-info":[{"award-number":["(61772454, 61811530332, 61811540410)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>In a real manufacturing environment, the set of tasks that should be scheduled is changing over the time, which means that scheduling problems are dynamic. Also, in order to adapt the manufacturing systems with fluctuations, such as machine failure and create bottleneck machines, various flexibilities are considered in this system. For the first time, in this research, we consider the operational flexibility and flexibility due to Parallel Machines (PM) with non-uniform speed in Dynamic Job Shop (DJS) and in the field of Flexible Dynamic Job-Shop with Parallel Machines (FDJSPM) model. After modeling the problem, an algorithm based on the principles of Genetic Algorithm (GA) with dynamic two-dimensional chromosomes is proposed. The results of proposed algorithm and comparison with meta-heuristic data in the literature indicate the improvement of solutions by 1.34 percent for different dimensions of the problem.<\/jats:p>","DOI":"10.3390\/sym11020165","type":"journal-article","created":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T11:19:58Z","timestamp":1549019998000},"page":"165","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["A New Meta-Heuristic Algorithm for Solving the Flexible Dynamic Job-Shop Problem with Parallel Machines"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0229-2460","authenticated-orcid":false,"given":"Arun Kumar","family":"Sangaiah","sequence":"first","affiliation":[{"name":"School of Computing Science and Engineering, Vellore Institute of Technology (VIT), Vellore 632014, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohsen Yaghoubi","family":"Suraki","sequence":"additional","affiliation":[{"name":"Department of IT and Computer Engineering Qazvin Branch, Islamic Azad University, Qazvin 1519534199, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Sadeghilalimi","sequence":"additional","affiliation":[{"name":"Department Hamun Islamic Azad University of Qazvin 1519534199, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyed Mostafa","family":"Bozorgi","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Tehran North Branch, Islamic Azad University, Tehran 1651153311, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Asghar Rahmani","family":"Hosseinabadi","sequence":"additional","affiliation":[{"name":"Young Researchers and Elite Club, Ayatollah Amoli Branch, Islamic Azad University, Amol 4865116915, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5473-8738","authenticated-orcid":false,"given":"Jin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer &amp; Communication Engineering, Changsha University of Science &amp; Technology, Changsha 410004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,2,1]]},"reference":[{"key":"ref_1","unstructured":"Baker, K.R. (1974). Introduction to Sequencing and Scheduling, John Wiley & Sons."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10479-014-1770-8","article-title":"Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises","volume":"229","author":"Hosseinabadi","year":"2015","journal-title":"Ann. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","article-title":"Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems","volume":"54","author":"Tay","year":"2007","journal-title":"Comput. Ind. Eng."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s10479-015-1855-z","article-title":"OSGA: Genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises","volume":"229","author":"Shamshirband","year":"2015","journal-title":"Ann. Oper. Res."},{"key":"ref_5","first-page":"1870","article-title":"Present a New Hybrid Algorithm Scheduling Flexible Manufacturing System Consideration Cost Maintenance","volume":"4","author":"Farahabadi","year":"2013","journal-title":"Int. J. Sci. Eng. Res."},{"key":"ref_6","first-page":"745","article-title":"Presentation of a New and Beneficial Method Through Problem Solving Timing of Open Shop by Random Algorithm Gravitational Emulation Local Search","volume":"10","author":"Hosseinabadi","year":"2013","journal-title":"Int. J. Comput. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Shojafar, M., Kardgar, M., Hosseinabadi, A.R., Shamshirband, S., and Abraham, A. (2015, January 16\u201318). TETS: A Genetic-based Scheduler in Cloud Computing to Decrease Energy and Makespan. Proceedings of the 15th International Conference on Hybrid Intelligent Systems (HIS 2015), Seoul, Korea. Chapter Advances in Intelligent Systems and Computing.","DOI":"10.1007\/978-3-319-27221-4_9"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/j.cie.2016.12.045","article-title":"Recent advances in hybrid evolutionary algorithms for multiobjective manufacturing scheduling","volume":"112","author":"Gena","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_9","first-page":"433","article-title":"A PSO based Energy Efficient Coverage Control Algorithm for Wireless Sensor Networks","volume":"56","author":"Wang","year":"2018","journal-title":"Comput. Mater. Contin."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Tirkolaee, E.B., Hosseinabadi, A.R., Soltani, M., Sangaiah, A.K., and Wang, J. (2018). A Hybrid Genetic Algorithm for Multi-trip Green Capacitated Arc Routing Problem in the Scope of Urban Services. Sustainability, 10.","DOI":"10.3390\/su10051366"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"10016","DOI":"10.1016\/j.eswa.2012.01.211","article-title":"Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm","volume":"39","author":"Chen","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2111","DOI":"10.1016\/j.camwa.2012.04.007","article-title":"Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints","volume":"64","author":"Dalfard","year":"2012","journal-title":"Comput. Math. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0272-6963(00)00031-0","article-title":"A review of empirical research on manufacturing exibility","volume":"18","author":"Vokurka","year":"2000","journal-title":"J. Oper. Manag."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"7754","DOI":"10.1016\/j.eswa.2014.06.023","article-title":"Modeling and heuristics for scheduling of distributed job shops","volume":"41","author":"Naderi","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.cie.2017.05.026","article-title":"A reinforcement learning approach to parameter estimation in dynamic job shop scheduling","volume":"110","author":"Shahrabi","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cie.2017.02.019","article-title":"Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem","volume":"107","author":"Yazdani","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0377-2217(98)00060-5","article-title":"A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan","volume":"109","author":"Riane","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0377-2217(97)00260-9","article-title":"The flow shop with parallel machines: A taboo search approach","volume":"106","author":"Nowicki","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0377-2217(98)00029-0","article-title":"Theory and methodology, exploiting process plan flexibility in production scheduling: A multi-objective approach","volume":"114","author":"Brandimarte","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0360-8352(99)00019-4","article-title":"Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence","volume":"37","author":"Ghedjati","year":"1999","journal-title":"Comput. Ind. Eng."},{"key":"ref_21","first-page":"521","article-title":"Approximation algorithms for flexible job shop problems","volume":"12","author":"Jansen","year":"2001","journal-title":"Int. J. Found. Comput. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","article-title":"Approach by localization and multi objective evolutionary optimization for flexible job-shop scheduling problems","volume":"32","author":"Kacem","year":"2002","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0360-8352(02)00079-7","article-title":"Advanced planning and scheduling with outsourcing in manufacturing supply chain","volume":"43","author":"Lee","year":"2002","journal-title":"Comput. Ind. Eng."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1016\/S0305-0548(02)00063-1","article-title":"A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling","volume":"30","author":"Kim","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/S0377-2217(02)00563-5","article-title":"Handling flexibility in a \u201cgeneralised job shop\u201d with a fuzzy approach","volume":"147","author":"Allet","year":"2003","journal-title":"Eur. J. Oper. Res."},{"key":"ref_26","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 taboo search approach","volume":"15","author":"Scrich","year":"2004","journal-title":"J. Intell. Manuf."},{"key":"ref_27","unstructured":"Gen, M., and Cheng, R. (2004). Genetic Algorithm in Search, Optimization and Machine Learning, Addition-Wesley."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2013","DOI":"10.1016\/j.cor.2004.01.003","article-title":"Simulated annealing heuristic for flow shop scheduling problem with unrelated parallel machines","volume":"32","author":"Low","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","article-title":"An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems","volume":"48","author":"Xia","year":"2005","journal-title":"Comput. Ind. Eng."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.ijpe.2004.05.005","article-title":"The common cycle economic lot scheduling in flexible job shops: The finite horizon case","volume":"97","author":"Torabi","year":"2005","journal-title":"Int. J. Prod. Econ."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1629","DOI":"10.1016\/j.camwa.2005.07.008","article-title":"Complexity and algorithms for two-stage flexible flow shop scheduling with availability constraints","volume":"50","author":"Wang","year":"2005","journal-title":"Comput. Math. Appl."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Tay, J.C., and Wibowo, D. (2004, January 26\u201330). An effective chromosome representation for evolving flexible job-shop scheduling. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), Seattle, WA, USA.","DOI":"10.1007\/978-3-540-24855-2_19"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2004.05.017","article-title":"Flexible flow shop scheduling with uniform parallel machines","volume":"168","author":"Kyparisis","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.ejor.2006.04.007","article-title":"An effective architecture for learning and evolving flexible job shap schedules","volume":"179","author":"Ho","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10845-005-0021-x","article-title":"Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm","volume":"17","author":"Gao","year":"2007","journal-title":"J. Intell. Manuf."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","article-title":"A hybrid genetic algorithm for the job shop scheduling problems","volume":"45","author":"Park","year":"2003","journal-title":"Comput. Ind. Eng."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0377-2217(03)00401-6","article-title":"Scheduling flexible flowlines with sequence-dependent setup times","volume":"159","author":"Kurz","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0925-5273(03)00123-3","article-title":"Comparing scheduling rules for flexible flow-lines","volume":"85","author":"Kurz","year":"2003","journal-title":"Int. J. Prod. Econ."},{"key":"ref_39","unstructured":"Abbasian, M., and Nahavandi, N. (2008). Minimization Flow Time in a flexible Dynamic Job Shop with Parallel Machines. [Master\u2019s Thesis, Engineering Department of Industrial Engineering, Tarbiat Modares University]."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/2\/165\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:30:14Z","timestamp":1760185814000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/2\/165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,1]]},"references-count":39,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2019,2]]}},"alternative-id":["sym11020165"],"URL":"https:\/\/doi.org\/10.3390\/sym11020165","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,1]]}}}