{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:59:06Z","timestamp":1772276346439,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T00:00:00Z","timestamp":1646438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T00:00:00Z","timestamp":1646438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["12001169"],"award-info":[{"award-number":["12001169"]}],"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":["11971443"],"award-info":[{"award-number":["11971443"]}],"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":["11771406"],"award-info":[{"award-number":["11771406"]}],"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":["61971380"],"award-info":[{"award-number":["61971380"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University Grants Council of Hong Kong","award":["PolyU 152148\/15E"],"award-info":[{"award-number":["PolyU 152148\/15E"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10951-022-00720-2","type":"journal-article","created":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T09:02:42Z","timestamp":1646470962000},"page":"523-533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Approximation algorithms for batch scheduling with processing set restrictions"],"prefix":"10.1007","volume":"26","author":[{"given":"Xing","family":"Chai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3925-9066","authenticated-orcid":false,"given":"Wenhua","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. T.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,5]]},"reference":[{"issue":"1","key":"720_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., & van de Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1(1), 31\u201354.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"720_CR2","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/j.ijpe.2011.04.024","volume":"133","author":"L Epstein","year":"2011","unstructured":"Epstein, L., & Levin, A. (2011). Scheduling with processing set restrictions: PTAS results for several variants. International Journal of Production Economics, 133(2), 586\u2013595.","journal-title":"International Journal of Production Economics"},{"key":"720_CR3","doi-asserted-by":"crossref","unstructured":"Lawler, E.\u00a0L., Lenstra, J.\u00a0K. Rinnooy\u00a0Kan, A.\u00a0H.\u00a0G. & Shmoys, D. B. (1993). Sequencing and scheduling: Algorithms and complexity. In Handbooks in Operations Research and Management Science, Logistics of Production and Inventory, Vol. 4, (pp. 445\u2013522). Elsevier.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"issue":"1","key":"720_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"CY Lee","year":"1999","unstructured":"Lee, C. Y., & Uzsoy, R. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37(1), 219\u2013236.","journal-title":"International Journal of Production Research"},{"key":"720_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijpe.2014.09.038","volume":"175","author":"JY-T Leung","year":"2016","unstructured":"Leung, J.Y.-T., & Li, C.-L. (2016). Scheduling with processing set restrictions: A literature update. International Journal of Production Economics, 175, 1\u201311.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"720_CR6","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.ejor.2017.01.013","volume":"260","author":"JY-T Leung","year":"2017","unstructured":"Leung, J.Y.-T., & Ng, C. T. (2017). Fast approximation algorithms for uniform machine scheduling with processing set restrictions. European Journal of Operational Research, 260(2), 507\u2013513.","journal-title":"European Journal of Operational Research"},{"key":"720_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2017.06.003","volume":"689","author":"SG Li","year":"2017","unstructured":"Li, S. G. (2017). Parallel batch scheduling with nested processing set restrictions. Theoretical Computer Science, 689, 117\u2013125.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"720_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ejor.2016.11.044","volume":"260","author":"SG Li","year":"2017","unstructured":"Li, S. G. (2017). Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan. European Journal of Operational Research, 260(1), 12\u201320.","journal-title":"European Journal of Operational Research"},{"key":"720_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10479-020-03632-6","volume":"296","author":"CT Ng","year":"2021","unstructured":"Ng, C. T., Cheng, T. C. E., Levner, E., & Kriheli, B. (2021). Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm. Annals of Operations Research, 296, 407\u2013420.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"720_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10878-005-6855-5","volume":"9","author":"CK Poon","year":"2005","unstructured":"Poon, C. K., & Yu, W. C. (2005). On-line scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization, 9(2), 167\u2013186.","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00720-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00720-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00720-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T08:10:41Z","timestamp":1701072641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00720-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,5]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["720"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00720-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,5]]},"assertion":[{"value":"4 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}