{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T19:28:57Z","timestamp":1781292537621,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819777976","type":"print"},{"value":"9789819777983","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7798-3_5","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"48-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Approximation Algorithms for\u00a0Parallel Batch Machine Scheduling of\u00a0Malleable Jobs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6731-4694","authenticated-orcid":false,"given":"Fenghe","family":"Xia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2891-4253","authenticated-orcid":false,"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8563-4958","authenticated-orcid":false,"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1016\/j.ejor.2006.11.047","volume":"189","author":"B Chen","year":"2008","unstructured":"Chen, B., Lee, C.Y.: Logistics scheduling with batching and transportation. Eur. J. Oper. Res. 189(3), 871\u2013876 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"5_CR2","doi-asserted-by":"publisher","first-page":"3161","DOI":"10.1016\/j.apm.2011.09.061","volume":"36","author":"B Cheng","year":"2012","unstructured":"Cheng, B., Yang, S., Hu, X., Chen, B.: Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes. Appl. Math. Model. 36(7), 3161\u20133167 (2012)","journal-title":"Appl. Math. Model."},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/nav.21587","volume":"61","author":"G Dosa","year":"2014","unstructured":"Dosa, G., Tan, Z., Tuza, Z., Yan, Y., L\u00e1nyi, C.S.: Improved bounds for batch scheduling with nonidentical job sizes. Naval Res. Logist. (NRL) 61(5), 351\u2013358 (2014)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","volume":"298","author":"JW Fowler","year":"2022","unstructured":"Fowler, J.W., M\u00f6nch, L.: A survey of scheduling with parallel batch (p-batch) processing. Eur. J. Oper. Res. 298(1), 1\u201324 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Annals of Discrete Mathematics, vol.\u00a05, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"12","key":"5_CR6","doi-asserted-by":"publisher","first-page":"3511","DOI":"10.1109\/TPDS.2017.2731843","volume":"28","author":"L Guo","year":"2017","unstructured":"Guo, L., Shen, H.: Efficient approximation algorithms for the bounded flexible scheduling problem in clouds. IEEE Trans. Parallel Distrib. Syst. 28(12), 3511\u20133520 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2742343","volume":"2","author":"N Jain","year":"2015","unstructured":"Jain, N., Menache, I., Naor, J., Yaniv, J.: Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. ACM Trans. Parallel Comput. (TOPC) 2(1), 1\u201329 (2015)","journal-title":"ACM Trans. Parallel Comput. (TOPC)"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40(4), 764\u2013775 (1992)","journal-title":"Oper. Res."},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.4304\/jsw.7.6.1203-1210","volume":"7","author":"S Li","year":"2012","unstructured":"Li, S.: Makespan minimization on parallel batch processing machines with release times and job sizes. J. Softw. 7(6), 1203\u20131210 (2012)","journal-title":"J. Softw."},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.ejor.2023.04.019","volume":"310","author":"J Ou","year":"2023","unstructured":"Ou, J., Lu, L., Zhong, X.: Parallel-batch scheduling with rejection: structural properties and approximation algorithms. Eur. J. Oper. Res. 310(3), 1017\u20131032 (2023)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228\u2013249 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R.: Scheduling a single batch processing machine with non-identical job sizes. Int. J. Prod. Res. 32(7), 1615\u20131635 (1994)","journal-title":"Int. J. Prod. Res."},{"issue":"6","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3342103","volume":"52","author":"C Wu","year":"2019","unstructured":"Wu, C., Buyya, R., Ramamohanarao, K.: Cloud pricing models: taxonomy, survey, and interdisciplinary challenges. ACM Comput. Surv. (CSUR) 52(6), 1\u201336 (2019)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ejor.2023.02.044","volume":"310","author":"X Wu","year":"2023","unstructured":"Wu, X., Loiseau, P.: Efficient approximation algorithms for scheduling moldable tasks. Eur. J. Oper. Res. 310(1), 71\u201383 (2023)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"G Zhang","year":"2001","unstructured":"Zhang, G., Cai, X., Lee, C.Y., Wong, C.K.: Minimizing makespan on a single batch processing machine with nonidentical job sizes. Naval Res. Logist. (NRL) 48(3), 226\u2013240 (2001)","journal-title":"Naval Res. Logist. (NRL)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.knosys.2016.10.026","volume":"116","author":"R Zhang","year":"2017","unstructured":"Zhang, R., Chang, P.C., Song, S., Wu, C.: A multi-objective artificial bee colony algorithm for parallel batch-processing machine scheduling in fabric dyeing processes. Knowl.-Based Syst. 116, 114\u2013129 (2017)","journal-title":"Knowl.-Based Syst."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7798-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:55Z","timestamp":1726769155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7798-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819777976","9789819777983"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7798-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}