{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:42:12Z","timestamp":1762522932132,"version":"build-2065373602"},"reference-count":44,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:00:00Z","timestamp":1725753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems"],"abstract":"<jats:p>Multiple production lines can work together to efficiently manufacture certain products. Thus, when capacity is insufficient, it is necessary to decide whether to develop new production lines to ensure the timely completion of all orders. For example, running a new production line for a small number of orders is not cost-effective. Therefore, decision-making involves choosing between paying tardiness costs for a few orders, abandoning some orders, or developing new production lines to maximize efficiency. Additionally, the timely transportation of completed orders is crucial and depends on vehicle usage efficiency. From a transportation perspective, fully loading vehicles is the most efficient, but this may impact the timeliness of orders, leading to potential tardiness costs. By comprehensively considering these aspects, a multi-machine production model is constructed that incorporates transportation batch sequences and uses heuristic algorithms to solve the problem. Finally, designed case examples validate the effectiveness of the model and algorithm.<\/jats:p>","DOI":"10.3390\/systems12090354","type":"journal-article","created":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:15:01Z","timestamp":1725855301000},"page":"354","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Integrating Order Splitting and Acceptance with Batch Delivery in Parallel Machine Scheduling"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-9419-9775","authenticated-orcid":false,"given":"Hanxing","family":"Cui","sequence":"first","affiliation":[{"name":"School of Economics and Management, Beijing Jiaotong University, Beijing 100082, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qilan","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Beijing Jiaotong University, Beijing 100082, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9963-9423","authenticated-orcid":false,"given":"Huanhuan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Beijing Jiaotong University, Beijing 100082, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuliang","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Beijing Jiaotong University, Beijing 100082, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6877-5059","authenticated-orcid":false,"given":"Junjie","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Beijing Jiaotong University, Beijing 100082, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,9,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1287\/ijoc.2021.1113","article-title":"Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem","volume":"34","author":"Li","year":"2022","journal-title":"INFORMS J. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"105291","DOI":"10.1016\/j.cor.2021.105291","article-title":"Unrelated parallel machine scheduling with new criteria: Complexity and models","volume":"132","author":"Bitar","year":"2021","journal-title":"Comput. Operat. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"307","DOI":"10.14311\/AP.2021.61.0307","article-title":"Parallel machine scheduling with Monte Carlo Tree Search","volume":"61","year":"2021","journal-title":"Acta Polytech."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1080\/00207543.2019.1600763","article-title":"Parallel machine, capacitated lot-sizing and scheduling for the pipe-insulation industry","volume":"58","author":"Laguna","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Lee, J.H., and Jang, H. (2019). Uniform parallel machine scheduling with dedicated machines, job splitting and setup resources. Sustainability, 11.","DOI":"10.3390\/su11247137"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.ejor.2020.09.037","article-title":"A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions","volume":"291","author":"Fang","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.tcs.2020.03.013","article-title":"Makespan minimization on unrelated parallel machines with a few bags","volume":"821","author":"Page","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Ar\u0131k, O.A., and Toksar\u0131, M.D. (2019). Fuzzy parallel machine scheduling problem under fuzzy job deterioration and learning effects with fuzzy processing times. Advanced Fuzzy Logic Approaches in Engineering Science, IGI Global.","DOI":"10.4018\/978-1-5225-5709-8.ch003"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.omega.2018.10.003","article-title":"Parallel machine scheduling with job synchronization to enable efficient material flows in hub terminals","volume":"89","author":"Guo","year":"2019","journal-title":"Omega"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1080\/01605682.2018.1464428","article-title":"Scheduling step-deteriorating jobs on bounded parallel-batching machines to maximise the total net revenue","volume":"70","author":"Pei","year":"2019","journal-title":"J. Oper. Res. Soc."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.ejor.2020.10.052","article-title":"Bi-objective parallel machine scheduling with additional resources during setups","volume":"292","author":"Perea","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.jclepro.2018.05.056","article-title":"Bi-objective identical parallel machine scheduling to minimize total energy consumption and makespan","volume":"193","author":"Wang","year":"2018","journal-title":"J. Clean. Prod."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/s11750-018-00494-x","article-title":"MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints","volume":"27","author":"Sarac","year":"2019","journal-title":"TOP"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.eswa.2017.09.054","article-title":"Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource","volume":"93","author":"Villa","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.jclepro.2019.01.166","article-title":"Bi-objective green scheduling in uniform parallel machine environments","volume":"217","author":"Safarzadeh","year":"2019","journal-title":"J. Clean. Prod."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10951-018-0597-6","article-title":"The Longest Processing Time rule for identical parallel machines revisited","volume":"23","author":"Scatamacchia","year":"2020","journal-title":"J. Sched."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"108800","DOI":"10.1016\/j.cie.2022.108800","article-title":"A generic optimization framework for scheduling problems under machine deterioration and maintenance activities","volume":"174","author":"Rudek","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"109675","DOI":"10.1016\/j.cie.2023.109675","article-title":"Hybrid multi-objective evolutionary meta-heuristics for a parallel machine scheduling problem with setup times and preferences","volume":"185","author":"Srinath","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10479-017-2615-z","article-title":"Bounds for parallel machine scheduling with predefined parts of jobs and setup time","volume":"261","author":"Kim","year":"2018","journal-title":"Ann. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2722","DOI":"10.1080\/00207543.2020.1740341","article-title":"A hybrid differential evolution algorithm for parallel machine scheduling of lace dyeing considering colour families, sequence-dependent setup and machine eligibility","volume":"59","author":"Li","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1080\/00207543.2020.1734682","article-title":"Heuristics with novel approaches for cyclical multiple parallel machine scheduling in sugarcane unloading systems","volume":"59","author":"Kusoncum","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"111746","DOI":"10.1016\/j.asoc.2024.111746","article-title":"A K-means-Teaching Learning based optimization algorithm for parallel machine scheduling problem","volume":"161","author":"Li","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"5259","DOI":"10.1080\/00207543.2020.1775911","article-title":"An improved artificial bee colony for multi-objective distributed unrelated parallel machine scheduling","volume":"59","author":"Lei","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"106320","DOI":"10.1016\/j.cie.2020.106320","article-title":"An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance","volume":"141","author":"Lei","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.omega.2018.01.001","article-title":"A memetic differential evolution algorithm for energy-efficient parallel machine scheduling","volume":"82","author":"Wu","year":"2019","journal-title":"Omega"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1080\/00207543.2021.1885068","article-title":"Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times","volume":"60","author":"Yunusoglu","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ijpe.2018.04.013","article-title":"Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks","volume":"201","author":"Wu","year":"2018","journal-title":"Int. J. Prod. Econ."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/ijoc.2018.0809","article-title":"A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching","volume":"30","author":"Kowalczyk","year":"2018","journal-title":"INFORMS J. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.apm.2021.01.017","article-title":"Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times","volume":"94","author":"Ewees","year":"2021","journal-title":"Appl. Math. Model."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/j.cie.2018.09.016","article-title":"An improved cuckoo search algorithm for scheduling jobs on identical parallel machines","volume":"126","author":"Laha","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cie.2018.07.001","article-title":"A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times","volume":"124","author":"Majumder","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TASE.2019.2945717","article-title":"A knowledge-based cuckoo search algorithm to schedule a flexible job shop with sequencing flexibility","volume":"18","author":"Cao","year":"2019","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"105637","DOI":"10.1016\/j.cor.2021.105637","article-title":"Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times","volume":"139","author":"Soares","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s10951-020-00640-z","article-title":"On the exact solution of a large class of parallel machine scheduling problems","volume":"23","author":"Sadykov","year":"2020","journal-title":"J. Sched."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.tcs.2017.12.001","article-title":"Identical parallel machine scheduling with time-dependent processing times","volume":"721","author":"Ouazene","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.cie.2018.05.014","article-title":"A constraint programming approach for solving unrelated parallel machine scheduling problem","volume":"121","author":"Gedik","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1002\/nav.21863","article-title":"An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines","volume":"66","author":"Xiong","year":"2019","journal-title":"Naval Res. Logist. (NRL)"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.eswa.2018.09.041","article-title":"A metaheuristic algorithm and simulation to study the effect of learning or tiredness on sequence-dependent setup times in a parallel machine scheduling problem","volume":"117","author":"Alvarez","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Ezugwu, A.E., Adeleke, O.J., and Viriri, S. (2018). Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times. PLoS ONE, 13.","DOI":"10.1371\/journal.pone.0200030"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.cor.2019.07.016","article-title":"Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem","volume":"111","author":"Vallada","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"112959","DOI":"10.1016\/j.eswa.2019.112959","article-title":"GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources","volume":"141","author":"Villa","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.jmsy.2017.11.001","article-title":"Coordinating order acceptance and integrated production-distribution scheduling with batch delivery considering Third Party Logistics distribution","volume":"46","author":"Noroozi","year":"2018","journal-title":"J. Manuf. Syst."},{"key":"ref_43","unstructured":"Ingo, R. (1973). Evolutionsstrategie: Optimierung Technischer Systeme Nach Prinzipien der Biologischen Evolution, Frommann-Holzboog."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/j.asoc.2015.06.001","article-title":"Fuzzy adaptive genetic algorithm for multi-objective assembly line balancing problems","volume":"34","author":"Alavidoost","year":"2015","journal-title":"Appl. Soft Comput."}],"container-title":["Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-8954\/12\/9\/354\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:51:30Z","timestamp":1760111490000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-8954\/12\/9\/354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,8]]},"references-count":44,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["systems12090354"],"URL":"https:\/\/doi.org\/10.3390\/systems12090354","relation":{},"ISSN":["2079-8954"],"issn-type":[{"type":"electronic","value":"2079-8954"}],"subject":[],"published":{"date-parts":[[2024,9,8]]}}}