{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:31:52Z","timestamp":1736400712350,"version":"3.32.0"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100020783","name":"Fujian Provincial Federation of Social Sciences","doi-asserted-by":"publisher","award":["FJ2022C043"],"id":[{"id":"10.13039\/501100020783","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1016\/j.cor.2023.106474","type":"journal-article","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T18:55:47Z","timestamp":1699642547000},"page":"106474","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints"],"prefix":"10.1016","volume":"162","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1504-8982","authenticated-orcid":false,"given":"Kanxin","family":"Hu","sequence":"first","affiliation":[]},{"given":"Yuxin","family":"Che","sequence":"additional","affiliation":[]},{"given":"Tsan Sheng","family":"Ng","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Deng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2023.106474_b1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.cor.2016.08.015","article-title":"Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times","volume":"78","author":"Arroyo","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106474_b2","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.cie.2016.12.038","article-title":"An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times","volume":"105","author":"Arroyo","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2023.106474_b3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.engappai.2018.10.012","article-title":"An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times","volume":"77","author":"Arroyo","year":"2019","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"10.1016\/j.cor.2023.106474_b4","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1016\/j.ejor.2016.08.008","article-title":"Scheduling identical parallel machines with tooling constraints","volume":"257","author":"Beez\u00e3o","year":"2017","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2023.106474_b5","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1040.0109","article-title":"A new placement heuristic for the orthogonal stock-cutting problem","volume":"52","author":"Burke","year":"2004","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2023.106474_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105245","article-title":"Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing","author":"Che","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106474_b7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/j.compeleceng.2018.02.049","article-title":"An adaptive large neighborhood search heuristic for dynamic vehicle routing problems","volume":"67","author":"Chen","year":"2018","journal-title":"Comput. Electr. Eng."},{"key":"10.1016\/j.cor.2023.106474_b8","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.cie.2018.09.048","article-title":"Production scheduling and nesting in additive manufacturing","volume":"126","author":"Chergui","year":"2018","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.cor.2023.106474_b9","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1016\/j.eswa.2011.08.029","article-title":"A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times","volume":"39","author":"Damodaran","year":"2012","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"10.1016\/j.cor.2023.106474_b10","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1111\/itor.12273","article-title":"Evaluating the importance of randomization in adaptive large neighborhood search","volume":"24","author":"Hemmati","year":"2017","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2023.106474_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105847","article-title":"Scheduling unrelated additive manufacturing machines with practical constraints","volume":"144","author":"Hu","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2023.106474_b12","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2014.07.039","article-title":"A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes","volume":"240","author":"Jia","year":"2015","journal-title":"European J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2023.106474_b13","doi-asserted-by":"crossref","first-page":"1628","DOI":"10.1080\/00207543.2019.1672900","article-title":"Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times","volume":"58","author":"Kim","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2023.106474_b14","article-title":"Integrated order batching and vehicle routing operations in grocery retail\u2013a general adaptive large neighborhood search algorithm","author":"Kuhn","year":"2020","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106474_b15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0360-8352(96)00205-7","article-title":"Developing a simulated annealing algorithm for the cutting stock problem","volume":"32","author":"Lai","year":"1997","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.cor.2023.106474_b16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","article-title":"A two-stage intelligent search algorithm for the two-dimensional strip packing problem","volume":"215","author":"Leung","year":"2011","journal-title":"European J. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2023.106474_b17","doi-asserted-by":"crossref","first-page":"2983","DOI":"10.1016\/j.cor.2013.06.016","article-title":"Scheduling unrelated parallel batch processing machines with non-identical job sizes","volume":"40","author":"Li","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"February 2017","key":"10.1016\/j.cor.2023.106474_b18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.ijpe.2017.11.015","article-title":"Single batch processing machine scheduling with two-dimensional bin packing constraints","volume":"196","author":"Li","year":"2018","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2023.106474_b19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cor.2017.04.006","article-title":"An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time","volume":"86","author":"Liu","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106474_b20","first-page":"43","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1nez","year":"2016","journal-title":"Oper. Res. Perspect."},{"key":"10.1016\/j.cor.2023.106474_b21","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.asoc.2018.02.018","article-title":"A hybrid ABC-TS algorithm for the unrelated parallel-batching machines scheduling problem with deteriorating jobs and maintenance activity","volume":"66","author":"Lu","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2023.106474_b22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.artmed.2016.10.002","article-title":"An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem","volume":"74","author":"Lusby","year":"2016","journal-title":"Artif. Intell. Med."},{"key":"10.1016\/j.cor.2023.106474_b23","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.asoc.2015.11.034","article-title":"Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling","volume":"40","author":"Rifai","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2023.106474_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106803","article-title":"Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review","volume":"149","author":"Rolim","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2023.106474_b25","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.cor.2017.06.019","article-title":"Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study","volume":"88","author":"Shahidi-Zadeh","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106474_b26","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.asoc.2017.08.014","article-title":"A bi-objective batch processing problem with dual-resources on unrelated-parallel machines","volume":"61","author":"Shahvari","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2023.106474_b27","series-title":"International Conference on Principles and Practice of Constraint Programming","first-page":"417","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"issue":"2","key":"10.1016\/j.cor.2023.106474_b28","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1016\/j.eswa.2009.06.070","article-title":"Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics","volume":"37","author":"Wang","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2023.106474_b29","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.cor.2016.11.024","article-title":"An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation","volume":"80","author":"Wei","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106474_b30","series-title":"2014 10th International Conference on Natural Computation, ICNC 2014, Vol. 82","first-page":"203","article-title":"An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints","author":"Wei","year":"2014"},{"issue":"3","key":"10.1016\/j.cor.2023.106474_b31","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1016\/j.ejor.2017.08.035","article-title":"A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints","volume":"265","author":"Wei","year":"2018","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106474_b32","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.ijpe.2013.04.053","article-title":"A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system","volume":"145","author":"Xu","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2023.106474_b33","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.eswa.2017.04.050","article-title":"An adaptive large neighborhood search heuristic for solving a robust gate assignment problem","volume":"84","author":"Yu","year":"2017","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"10.1016\/j.cor.2023.106474_b34","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1051\/ro\/2021062","article-title":"Efficient algorithms to minimize makespan of the unrelated parallel batch-processing machines scheduling problem with unequal job ready times","volume":"55","author":"Zarook","year":"2021","journal-title":"RAIRO-Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106474_b35","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/TR.2021.3128167","article-title":"An adaptive large neighborhood search for single-machine batch processing scheduling with 2-D rectangular bin-packing constraints","volume":"71","author":"Zeng","year":"2021","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/j.cor.2023.106474_b36","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.knosys.2016.10.026","article-title":"A multi-objective artificial bee colony algorithm for parallel batch-processing machine scheduling in fabric dyeing processes","volume":"116","author":"Zhang","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.cor.2023.106474_b37","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.asoc.2017.12.012","article-title":"A hybrid swarm algorithm based on ABC and AIS for 2L-HFCVRP","volume":"64","author":"Zhang","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2023.106474_b38","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108167","article-title":"Minimizing makespan on parallel batch processing machines with two-dimensional rectangular jobs","volume":"169","author":"Zhou","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2023.106474_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.116907","article-title":"Scheduling a single batch processing machine with non-identical two-dimensional job sizes","volume":"201","author":"Zhou","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2023.106474_b40","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.cie.2018.06.018","article-title":"A modified particle swarm optimization algorithm for a batch-processing machine scheduling problem with arbitrary release times and non-identical job sizes","volume":"123","author":"Zhou","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2023.106474_b41","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.amc.2018.04.024","article-title":"A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes","volume":"334","author":"Zhou","year":"2018","journal-title":"Appl. Math. Comput."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823003386?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823003386?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T20:49:17Z","timestamp":1736369357000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054823003386"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":41,"alternative-id":["S0305054823003386"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2023.106474","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2023.106474","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106474"}}