{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T13:34:09Z","timestamp":1772112849404,"version":"3.50.1"},"reference-count":29,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFB3300503"],"award-info":[{"award-number":["2021YFB3300503"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>This study proposes an approach to minimize the maximum makespan of the integrated scheduling problem in flexible job-shop environments, taking into account conflict-free routing problems. A hybrid genetic algorithm is developed for production scheduling, and the optimal ranges of crossover and mutation probabilities are also discussed. The study applies the proposed algorithm to 82 test problems and demonstrates its superior performance over the Sliding Time Window (STW) heuristic proposed by Bilge and the Genetic Algorithm proposed by Ulusoy (UGA). For conflict-free routing problems of Automated Guided Vehicles (AGVs), the genetic algorithm based on AGV coding is used to study the AGV scheduling problem, and specific solutions are proposed to solve different conflicts. In addition, sensors on the AGVs provide real-time data to ensure that the AGVs can navigate through the environment safely and efficiently without causing any conflicts or collisions with other AGVs or objects in the environment. The Dijkstra algorithm based on a time window is used to calculate the shortest paths for all AGVs. Empirical evidence on the feasibility of the proposed approach is presented in a study of a real flexible job-shop. This approach can provide a highly efficient and accurate scheduling method for manufacturing enterprises.<\/jats:p>","DOI":"10.3390\/s23094526","type":"journal-article","created":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T02:29:22Z","timestamp":1683512962000},"page":"4526","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An Approach to Integrated Scheduling of Flexible Job-Shop Considering Conflict-Free Routing Problems"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-5312-6697","authenticated-orcid":false,"given":"Jiachen","family":"Sun","sequence":"first","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Manufacturing and Robotics, School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200444, China"}]},{"given":"Zifeng","family":"Xu","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Manufacturing and Robotics, School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200444, China"}]},{"given":"Zhenhao","family":"Yan","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Manufacturing and Robotics, School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200444, China"}]},{"given":"Lilan","family":"Liu","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Manufacturing and Robotics, School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200444, China"}]},{"given":"Yixiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Manufacturing and Robotics, School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200444, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,5,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2269","DOI":"10.1080\/002075498192896","article-title":"A new dynamic programming formulation of (nxm) flowshop sequencing problems with due dates","volume":"36","author":"Sonmez","year":"1998","journal-title":"Int. J. Prod. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.cie.2016.02.024","article-title":"Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multiagent model","volume":"102","author":"Nouri","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"e6950","DOI":"10.1002\/cpe.6950","article-title":"Optimum scheduling of machines, automated guided vehicles and tools without tool delay in a multi-machine flexible manufacturing system using symbiotic organisms search algorithm","volume":"34","author":"Mareddy","year":"2022","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2857","DOI":"10.1080\/00207549308956904","article-title":"Simultaneous scheduling of machines and automated guided vehicles","volume":"31","author":"Ulusoy","year":"1993","journal-title":"Int. J. Prod. Res."},{"key":"ref_5","first-page":"139","article-title":"Scheduling of AGVs and machines in FMS with makespan criteria using sheep flock heredity algorithm","volume":"4","author":"Subbaiah","year":"2009","journal-title":"Int. J. Phys. Sci."},{"key":"ref_6","first-page":"1461","article-title":"Performance optimization of simultaneous machine and automated guided vehicle scheduling using fuzzy logic controller based genetic algorithm","volume":"7","author":"Badakhshian","year":"2012","journal-title":"Int. J. Phys. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1080\/0951192X.2020.1858503","article-title":"Practical simultaneous scheduling of machines, AGVs, tool transporter and tools in a multi machine FMS using symbiotic organisms search algorithm","volume":"34","author":"Reddy","year":"2021","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1016\/j.asoc.2012.02.001","article-title":"A multi-agent based approach to dynamic scheduling of machines and automated guided vehicles in manufacturing systems","volume":"12","author":"Erol","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","article-title":"An effective genetic algorithm for the flexible job-shop scheduling problem","volume":"38","author":"Zhang","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"102198","DOI":"10.1016\/j.rcim.2021.102198","article-title":"Research on flexible job shop scheduling under finite transportation conditions for digital twin workshop","volume":"72","author":"Yan","year":"2021","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"ref_11","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":"Comput. Oper. Res."},{"key":"ref_12","first-page":"1496","article-title":"An optimized floyd algorithm for the shortest path problem","volume":"5","author":"Wei","year":"2010","journal-title":"J. Netw."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.asoc.2017.05.012","article-title":"A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization","volume":"59","author":"Mac","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Chen, X., Zhang, X., Huang, W., Liu, S., and Dai, H. (2019, January 22\u201324). Coordinated optimal path planning of multiple substation inspection robots based on conflict detection. Proceedings of the 2019 Chinese Automation Congress (CAC), Hangzhou, China.","DOI":"10.1109\/CAC48633.2019.8996479"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Sun, G., Zhou, R., Di, B., Dong, Z., and Wang, Y. (2019). A novel cooperative path planning for multi-robot persistent coverage with obstacles and coverage period constraints. Sensors, 19.","DOI":"10.3390\/s19091994"},{"key":"ref_16","unstructured":"M\u00f6hring, R.H., K\u00f6hler, E., Gawrilow, E., and Stenzel, B. (2004, January 1\u20133). Conflict-free real-time AGV routing. Proceedings of the Operations Research Proceedings 2004: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR)\u2014Jointly Organized with the Netherlands Society for Operations Research (NGB), Tilburg, The Netherlands."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1023\/B:FLEX.0000036032.41757.3d","article-title":"Dispatching and conflict-free routing of automated guided vehicles: An exact approach","volume":"15","author":"Desaulniers","year":"2003","journal-title":"Int. J. Flex. Manuf. Syst."},{"key":"ref_18","first-page":"5","article-title":"Application of Improved A* Algorithm in Magnetic Guidance AGV Path Planning","volume":"38","author":"Lin","year":"2019","journal-title":"Autom. Technol. Appl."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Xing, L., Liu, Y., Li, H., Wu, C.C., Lin, W.C., and Chen, X. (2020). A novel tabu search algorithm for multi-AGV routing problem. Mathematics, 8.","DOI":"10.3390\/math8020279"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"106270","DOI":"10.1016\/j.cie.2020.106270","article-title":"Time-space network model and MILP formulation of the conflict-free routing problem of a capacitated AGV system","volume":"141","author":"Murakami","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Yuan, Z., Yang, Z., Lv, L., and Shi, Y. (2020). A bi-level path planning algorithm for multi-AGV routing problem. Electronics, 9.","DOI":"10.3390\/electronics9091351"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.cie.2015.01.003","article-title":"An Ant Colony Algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs","volume":"86","author":"Evazabadian","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"5942","DOI":"10.1080\/00207543.2017.1308572","article-title":"Integrated production scheduling and vehicle routing problem with job splitting and delivery time windows","volume":"55","author":"Fu","year":"2017","journal-title":"Int. J. Prod. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1287\/opre.43.6.1058","article-title":"A time window approach to simultaneous scheduling of machines and material handling system in an FMS","volume":"43","author":"Bilge","year":"1995","journal-title":"Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1299\/jamdsm.4.701","article-title":"Dynamic optimization of simultaneous dispatching and conflict-free routing for automated guided vehicles-Petri net decomposition approach","volume":"4","author":"Tanaka","year":"2010","journal-title":"J. Adv. Mech. Des. Syst. Manuf."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1688","DOI":"10.1016\/j.cor.2005.07.004","article-title":"Scheduling and routing of automated guided vehicles: A hybrid approach","volume":"34","author":"Langevin","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Liu, L., Guo, K., Gao, Z., Li, J., and Sun, J. (2022). Digital Twin-Driven Adaptive Scheduling for Flexible Job Shops. Sustainability, 14.","DOI":"10.3390\/su14095340"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1080\/0020754032000123579","article-title":"A hybrid GA\/heuristic approach to the simultaneous scheduling of machines and automated guided vehicles","volume":"42","author":"Abdelmaguid","year":"2004","journal-title":"Int. J. Prod. Res."},{"key":"ref_29","unstructured":"Abdelmaguid, T.F. (2000). Scheduling of Flexible Manufacturing Systems Using Hybrid Genetic Algorithm. [Master\u2019s Thesis, Cairo University]."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/9\/4526\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:30:25Z","timestamp":1760124625000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/9\/4526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,6]]},"references-count":29,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["s23094526"],"URL":"https:\/\/doi.org\/10.3390\/s23094526","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,6]]}}}