{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:10:09Z","timestamp":1783059009252,"version":"3.54.6"},"reference-count":29,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T00:00:00Z","timestamp":1671667200000},"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":["61803246"],"award-info":[{"award-number":["61803246"]}],"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":["2019M663608"],"award-info":[{"award-number":["2019M663608"]}],"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":["2021BJ-34"],"award-info":[{"award-number":["2021BJ-34"]}],"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":["22GXFW0016"],"award-info":[{"award-number":["22GXFW0016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["61803246"],"award-info":[{"award-number":["61803246"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2019M663608"],"award-info":[{"award-number":["2019M663608"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2021BJ-34"],"award-info":[{"award-number":["2021BJ-34"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["22GXFW0016"],"award-info":[{"award-number":["22GXFW0016"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific Research Foundation of Shaanxi University of Science and Technology","award":["61803246"],"award-info":[{"award-number":["61803246"]}]},{"name":"Scientific Research Foundation of Shaanxi University of Science and Technology","award":["2019M663608"],"award-info":[{"award-number":["2019M663608"]}]},{"name":"Scientific Research Foundation of Shaanxi University of Science and Technology","award":["2021BJ-34"],"award-info":[{"award-number":["2021BJ-34"]}]},{"name":"Scientific Research Foundation of Shaanxi University of Science and Technology","award":["22GXFW0016"],"award-info":[{"award-number":["22GXFW0016"]}]},{"name":"Project of Xi\u2019an Science and Technology Program","award":["61803246"],"award-info":[{"award-number":["61803246"]}]},{"name":"Project of Xi\u2019an Science and Technology Program","award":["2019M663608"],"award-info":[{"award-number":["2019M663608"]}]},{"name":"Project of Xi\u2019an Science and Technology Program","award":["2021BJ-34"],"award-info":[{"award-number":["2021BJ-34"]}]},{"name":"Project of Xi\u2019an Science and Technology Program","award":["22GXFW0016"],"award-info":[{"award-number":["22GXFW0016"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>According to the characteristics of flexible job shop scheduling problems, a dual-resource constrained flexible job shop scheduling problem (DRCFJSP) model with machine and worker constraints is constructed such that the makespan and total delay are minimized. An improved African vulture optimization algorithm (IAVOA) is developed to solve the presented problem. A three-segment representation is proposed to code the problem, including the operation sequence, machine allocation, and worker selection. In addition, the African vulture optimization algorithm (AVOA) is improved in three aspects: First, in order to enhance the quality of the initial population, three types of rules are employed in population initialization. Second, a memory bank is constructed to retain the optimal individuals in each iteration to increase the calculation precision. Finally, a neighborhood search operation is designed for individuals with certain conditions such that the makespan and total delay are further optimized. The simulation results indicate that the qualities of the solutions obtained by the developed approach are superior to those of the existing approaches.<\/jats:p>","DOI":"10.3390\/s23010090","type":"journal-article","created":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T03:26:25Z","timestamp":1671765985000},"page":"90","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["An Improved African Vulture Optimization Algorithm for Dual-Resource Constrained Multi-Objective Flexible Job Shop Scheduling Problems"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2486-1246","authenticated-orcid":false,"given":"Zhou","family":"He","sequence":"first","affiliation":[{"name":"School of Electrical and Control Engineering, Shaanxi University of Science & Technology, Xi\u2019an 710021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Biao","family":"Tang","sequence":"additional","affiliation":[{"name":"College of Mechanical and Electrical Engineering, Shaanxi University of Science & Technology, Xi\u2019an 710021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"Luan","sequence":"additional","affiliation":[{"name":"College of Mechanical and Electrical Engineering, Shaanxi University of Science & Technology, Xi\u2019an 710021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,12,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.eswa.2016.07.046","article-title":"An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time","volume":"65","author":"Gao","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.cie.2017.09.005","article-title":"Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems","volume":"113","author":"Li","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"106064","DOI":"10.1016\/j.cie.2019.106064","article-title":"Solving the flexible job shop scheduling problem using an improved Jaya algorithm","volume":"137","author":"Caldeira","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_4","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":"Clust. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"106778","DOI":"10.1016\/j.cie.2020.106778","article-title":"A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem","volume":"149","author":"Chen","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"100664","DOI":"10.1016\/j.swevo.2020.100664","article-title":"An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints","volume":"54","author":"Zhang","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"104951","DOI":"10.1016\/j.cor.2020.104951","article-title":"Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem","volume":"121","author":"Ding","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"107211","DOI":"10.1016\/j.cie.2021.107211","article-title":"An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem","volume":"155","author":"Li","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Huang, B., Zhou, M., Lu, X.S., and Abusorrah, A. (ACM Comput. Surv., 2022). Scheduling of resource allocation systems with timed Petri nets: A Survey, ACM Comput. Surv., to be published.","DOI":"10.1145\/3570326"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1109\/TASE.2015.2490538","article-title":"Optimization of deterministic timed weighted marked graphs","volume":"14","author":"He","year":"2017","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmsy.2020.02.004","article-title":"Petri-net-based dynamic scheduling of flexible manufacturing system via deep reinforcement learning with graph convolutional network","volume":"55","author":"Hu","year":"2020","journal-title":"J. Manuf. Syst."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1007\/s10845-015-1161-2","article-title":"A Petri net-based particle swarm optimization approach for scheduling deadlock-prone flexible manufacturing systems","volume":"29","author":"Han","year":"2018","journal-title":"J. Intell. Manuf."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1876","DOI":"10.1109\/TCST.2021.3123963","article-title":"Symbolic scheduling of robotic cellular manufacturing systems with timed Petri nets","volume":"30","author":"Huang","year":"2022","journal-title":"IEEE Trans. Control Syst. Technol."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"114567","DOI":"10.1016\/j.eswa.2021.114567","article-title":"A Pareto based discrete Jaya algorithm for multi-objective flexible job shop scheduling problem","volume":"170","author":"Caldeira","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_15","unstructured":"Cao, X., and Yang, Z. (2011, January 28\u201329). An improved genetic algorithm for dual-resource constrained flexible job shop scheduling. Proceedings of the 2011 Fourth International Conference on Intelligent Computation Technology and Automation, Shenzhen, China."},{"key":"ref_16","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":"Comput. Ind. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"5554","DOI":"10.1080\/00207543.2016.1170226","article-title":"A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem","volume":"54","author":"Zheng","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1961","DOI":"10.1007\/s10845-015-1082-0","article-title":"A hybrid discrete particle swarm optimization for dual-resource constrained job shop scheduling with resource flexibility","volume":"28","author":"Zhang","year":"2017","journal-title":"J. Intell. Manuf."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Zhang, S., Du, H., Borucki, S., Jin, S., Hou, T., and Li, Z. (2021). Dual resource constrained flexible job shop scheduling based on improved quantum genetic algorithm. Machines, 9.","DOI":"10.3390\/machines9060108"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"107557","DOI":"10.1016\/j.cie.2021.107557","article-title":"A fatigue-conscious dual resource constrained flexible job shop scheduling problem by enhanced NSGA-II: An application from casting workshop","volume":"160","author":"Tan","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"119869","DOI":"10.1016\/j.jclepro.2019.119869","article-title":"Industry 4.0, digitization, and opportunities for sustainability","volume":"252","author":"Ghobakhloo","year":"2020","journal-title":"J. Clean. Prod."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"107408","DOI":"10.1016\/j.cie.2021.107408","article-title":"African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems","volume":"158","author":"Abdollahzadeh","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"3290","DOI":"10.1080\/00207543.2019.1581954","article-title":"Learning dispatching rules using random forest in flexible job shop scheduling problems","volume":"57","author":"Jun","year":"2019","journal-title":"Int. J. Prod. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","article-title":"Comparison of Multiobjective Evolutionary Algorithms: Empirical Results","volume":"8","author":"Zitzler","year":"2000","journal-title":"Evol. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","article-title":"Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach","volume":"3","author":"Zitzler","year":"1999","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Van Veldhuizen, D.A., and Lamont, G.B. (March, January 28). Multiobjective evolutionary algorithm test suites. Proceedings of the 1999 ACM Symposium on Applied Computing, San Antonio, TX, USA.","DOI":"10.1145\/298151.298382"},{"key":"ref_27","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":"2008","journal-title":"Comput. Ind. Eng."},{"key":"ref_28","unstructured":"Montgomery, D.C. (2017). Montgomery: Design and Analysis of Experiments, John Willy & Sons."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/1\/90\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:47:49Z","timestamp":1760147269000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/1\/90"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,22]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["s23010090"],"URL":"https:\/\/doi.org\/10.3390\/s23010090","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,22]]}}}