{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:18:15Z","timestamp":1760231895492,"version":"build-2065373602"},"reference-count":35,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T00:00:00Z","timestamp":1665446400000},"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":["61772160","LBHQ13092"],"award-info":[{"award-number":["61772160","LBHQ13092"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postdoctoral Science-Research Developmental Foundation of Heilongjiang Province of China","award":["61772160","LBHQ13092"],"award-info":[{"award-number":["61772160","LBHQ13092"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The integrated scheduling problem is a classical combinatorial optimization problem. The existing integrated scheduling algorithms generally adopt the short-time scheduling strategy that does not fully consider the impact of the degree of process parallelism on scheduling results. In order to further optimize the total processing time of a product and the utilization rate of a device, an integrated scheduling algorithm based on a process end time-driven and the long-time scheduling strategy is proposed. The proposed integrated scheduling algorithm sets up a separate candidate process queue for each device and determines the scheduling order for each scheduling queue on the premise of satisfying the constraint conditions of the process tree. Driven by the process end time, the algorithm finds schedulable processes for each device. If the schedulable process is unique, it is scheduled. Otherwise, if the schedulable process is not unique, the process with long-path and long-time is scheduled. In particular, the scheduling strategies of the scheduling queues of different devices are symmetric, and the constraint relationships between the processes in different queues are asymmetric. The case analysis results show that the proposed integrated scheduling algorithm is better than some existing algorithms in terms of the total processing time of a product and the average utilization rate of devices. Therefore, the proposed algorithm provides a new idea for processing the scheduling of a single complex product.<\/jats:p>","DOI":"10.3390\/sym14102106","type":"journal-article","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T06:13:27Z","timestamp":1665468807000},"page":"2106","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Integrated Scheduling Algorithm Based on a Process End Time-Driven and Long-Time Scheduling Strategy"],"prefix":"10.3390","volume":"14","author":[{"given":"Xiaojuan","family":"Zhan","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"},{"name":"College of Computer Science and Technology, Heilongjiang Institute of Technology, Harbin 150050, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiang","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4974-3054","authenticated-orcid":false,"given":"Dengju","family":"Yao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,11]]},"reference":[{"key":"ref_1","unstructured":"Akkaya, B. (2020). Era of Industry 4.0 Technologies and Environmental Performance of Thailand\u2019s Garment Industry: Role of Lean Manufacturing and Green Supply Chain Management Practices. Agile Business Leadership Methods for Industry 4.0, Emerald Publishing Limited."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Haseeb, M., Hussain, H., Slusarczyk, B., and Jermsittiparsert, K. (2019). Industry 4.0: A Solution towards Technology Challenges of Sustainable Business Performance. Soc. Sci., 8.","DOI":"10.3390\/socsci8050154"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1504","DOI":"10.1109\/COMST.2017.2691349","article-title":"Industrial internet: A survey on the enabling technologies, applications, and challenges","volume":"19","author":"Li","year":"2017","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_4","first-page":"2273","article-title":"Intelligent manufacturing\u2014Main Direction of\u201cMade in China 2025\u201d","volume":"26","author":"Zhou","year":"2015","journal-title":"China Mech. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","article-title":"A tutorial survey of job-shop scheduling problems using genetic algorithms\u2014I. representation","volume":"30","author":"Cheng","year":"1996","journal-title":"Comput. Ind. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","article-title":"Deterministic job-shop scheduling: Past, present and future","volume":"113","author":"Jain","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0360-8352(93)90272-Y","article-title":"Genetic neuro-scheduler for job shop scheduling","volume":"25","author":"Dagli","year":"1993","journal-title":"Comput. Ind. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0360-8352(99)00135-7","article-title":"An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate","volume":"36","author":"Sakawa","year":"1999","journal-title":"Comput. Ind. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1023\/B:JIMS.0000042665.10086.cf","article-title":"A simulated annealing algorithm for multi-agent systems: A job-shop scheduling application","volume":"15","author":"Aydin","year":"2004","journal-title":"J. Intell. Manuf."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.cie.2007.06.024","article-title":"Integration of genetic algorithm and gantt chart for job shop scheduling in distributed manufacturing systems","volume":"53","author":"Jia","year":"2007","journal-title":"Comput. Ind. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.cie.2007.11.007","article-title":"A pareto archive particle swarm optimization for multi-objective job shop scheduling","volume":"54","author":"Lei","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.neucom.2013.10.042","article-title":"An effective teaching\u2013learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time","volume":"148","author":"Xu","year":"2015","journal-title":"Neurocomputing"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1162\/EVCO_a_00183","article-title":"A hyper-heuristic ensemble method for static job-shop scheduling","volume":"24","author":"Hart","year":"2016","journal-title":"Evol. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"106544","DOI":"10.1016\/j.asoc.2020.106544","article-title":"An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem","volume":"95","author":"Li","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Xu, G., and Chen, Y. (2022). Petri-Net-Based Schedulingof Flexible Manufacturing SystemsUsing an Estimate Function. Symmetry, 14.","DOI":"10.3390\/sym14051052"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Gao, Y., Wang, Z., Gao, L., and Li, X. (2022). A Matheuristic Approach forthe No-Wait Flowshop SchedulingProblem with Makespan Criterion. Symmetry, 14.","DOI":"10.3390\/sym14050913"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"116498","DOI":"10.1016\/j.eswa.2022.116498","article-title":"A cooperative coevolutionary algorithm approach to the no-wait job shop scheduling problem","volume":"194","author":"Brizuela","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Hidri, L., and Elsherbeeny, A.M. (2022). Optimal Solution to the Two-StageHybrid Flow Shop SchedulingProblem with Removal andTransportation Times. Symmetry, 14.","DOI":"10.3390\/sym14071424"},{"key":"ref_19","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":"Eur. J. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Wang, Y., Peng, W., Lu, C., and Xia, H. (2022). A Multi-Objective CellularMemetic Optimization Algorithm forGreen Scheduling in Flexible JobShops. Symmetry, 14.","DOI":"10.3390\/sym14040832"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3901\/JME.2018.06.191","article-title":"Time-selective integrated scheduling algorithm considering the compactness of serial processes","volume":"54","author":"Xie","year":"2018","journal-title":"J. Mech. Eng."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"139","DOI":"10.3901\/JME.2011.11.139","article-title":"Integrated schedulingalgorithm based on event driven by machines\u2019 idle","volume":"47","author":"Xie","year":"2011","journal-title":"J. Mech. Eng."},{"key":"ref_23","first-page":"1332","article-title":"Machine-drivenintegrated scheduling algorithm with rollback-preemptive","volume":"37","author":"Xie","year":"2011","journal-title":"ActaAutom. Sin."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"246","DOI":"10.3901\/JME.2020.04.246","article-title":"Integrated scheduling algorithm of complex product with no-wait constraint based on virtual component","volume":"56","author":"Guo","year":"2020","journal-title":"J. Mech. Eng."},{"key":"ref_25","first-page":"3313","article-title":"Integrated Scheduling Algorithm of Complex Product with No-wait Constraint Based on Reverse Virtual Component","volume":"26","author":"Guo","year":"2020","journal-title":"Comput. Integr. Manuf. Syst."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1186\/s13638-021-01989-1","article-title":"An integrated scheduling algorithm for multi-device-processes with the strategy of exchanging adjacent parallel processes of the same device","volume":"2021","author":"Wang","year":"2021","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"032030","DOI":"10.1088\/1742-6596\/1748\/3\/032030","article-title":"Integrated scheduling algorithm for multiple complex products with due date constraints","volume":"1748","author":"Wang","year":"2021","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_28","first-page":"8898536","article-title":"Multiple-devices-process integrated scheduling algorithm with time-selective strategy for process sequence","volume":"2020","author":"Zhang","year":"2020","journal-title":"Complexity"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"5570575","DOI":"10.1155\/2021\/5570575","article-title":"An improved integrated scheduling algorithm with process sequence time-selective strategy","volume":"2021","author":"Wang","year":"2021","journal-title":"Complexity"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"5558949","DOI":"10.1155\/2021\/5558949","article-title":"Hybrid estimation of distribution algorithm for solving three-stage multiobjective integrated scheduling problem","volume":"2021","author":"Deng","year":"2021","journal-title":"Complexity"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Zhuang, Q., Deng, K., and Ye, X. (2021, January 28\u201330). Research on Integrated Scheduling Algorithm of Inbound and Depart Flights in Airport Based on Integrated Operation. Proceedings of the CONF-CDS 2021: The 2nd International Conference on Computing and Data Science, Stanford, CA, USA.","DOI":"10.1145\/3448734.3450827"},{"key":"ref_32","first-page":"92","article-title":"Integrated scheduling model of mixed cross-operation for container terminal","volume":"12","author":"Chen","year":"2012","journal-title":"J. Traffic Transp. Eng."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.tcs.2014.10.047","article-title":"Integrated scheduling of production and delivery on a single machine with availability constraint","volume":"562","author":"Fan","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.cie.2018.10.007","article-title":"An integrated scheduling method for AGV routing in automated container terminals","volume":"126","author":"Yang","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"107695","DOI":"10.1016\/j.cie.2021.107695","article-title":"Integrated scheduling optimization of U-shaped automated container terminal under loading and unloading mode","volume":"162","author":"Xu","year":"2021","journal-title":"Comput. Ind. Eng."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/10\/2106\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:49:45Z","timestamp":1760143785000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/10\/2106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,11]]},"references-count":35,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["sym14102106"],"URL":"https:\/\/doi.org\/10.3390\/sym14102106","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2022,10,11]]}}}