{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T04:11:17Z","timestamp":1768623077304,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1027316504440","type":"journal-article","created":{"date-parts":[[2003,11,9]],"date-time":"2003-11-09T22:46:39Z","timestamp":1068417999000},"page":"247-257","source":"Crossref","is-referenced-by-count":75,"title":["Approximation Algorithms in Batch Processing"],"prefix":"10.1007","volume":"7","author":[{"given":"Xiaotie","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5149231_CR1","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.40.4.750","volume":"40","author":"J.H. Ahmadi","year":"1992","unstructured":"J.H. Ahmadi, R.H. Ahmadi, S. Dasu, and C.S. Tang, \u201cBatching and scheduling jobs on batch and discrete processors,\u201d Operations Research, vol. 40, pp. 750-763, 1992.","journal-title":"Operations Research"},{"key":"5149231_CR2","unstructured":"J.J. Bartholdi, unpublished manuscript, 1988."},{"key":"5149231_CR3","doi-asserted-by":"crossref","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":"P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn, and S.L. van de Velde, \u201cScheduling a batching machine,\u201d Journal of Scheduling, vol. 1, pp. 31-54, 1998.","journal-title":"Journal of Scheduling"},{"key":"5149231_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","volume":"13","author":"V. Chandru","year":"1993","unstructured":"V. Chandru, C.Y. Lee, and R. Uzsoy, \u201cMinimizing total completion time on a batch processing machine with job families,\u201d Operations Research Letters, vol. 13, pp. 61-65, 1993a.","journal-title":"Operations Research Letters"},{"key":"5149231_CR5","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1080\/00207549308956847","volume":"31","author":"V. Chandru","year":"1993","unstructured":"V. Chandru, C.Y. Lee, and R. Uzsoy, \u201cMinimizing total completion time on batch processing machines,\u201d International Journal of Production Research, vol. 31, pp. 2097-2121, 1993b.","journal-title":"International Journal of Production Research"},{"key":"5149231_CR6","unstructured":"G. Dobson and R.S. Nambinadom, \u201cThe batch loading scheduling problem,\u201d Technical report, Simon Graduate School of Business Administration, University of Rochester, 1992."},{"key":"5149231_CR7","doi-asserted-by":"crossref","unstructured":"C.R. Glassey and W.W. Weng, \u201cDynamic batching heuristics for simultaneous processing,\u201d IEEE Transactions on Semiconductor Manufacturing, pp. 77-82, 1991.","DOI":"10.1109\/66.79719"},{"key":"5149231_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, \u201cOptimization and approximation in deterministic sequencing and scheduling,\u201d Annals of Discrete Mathematics, vol. 5, pp. 287-326, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"5149231_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y. Ikura","year":"1986","unstructured":"Y. Ikura and M. Gimple, \u201cScheduling algorithm for a single batch processing machine,\u201d Operations Research Letters, vol. 5, pp. 61-65, 1986.","journal-title":"Operations Research Letters"},{"key":"5149231_CR10","unstructured":"C.Y. Lee and R. Uzsoy, \u201cMinimizing makespan on a single batch processing machine with dynamic job arrivals,\u201d Technical report, Department of Industrial and System Engineering, University of Florida, January 1996."},{"key":"5149231_CR11","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C.Y. Lee","year":"1992","unstructured":"C.Y. Lee, R. Uzsoy, and L.A. MartinVega, \u201cEfficient algorithms for scheduling semiconductor burn-in operations,\u201d Operations Research, vol. 40, pp. 764-775, 1992.","journal-title":"Operations Research"},{"key":"5149231_CR12","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/0377-2217(95)00332-0","volume":"96","author":"C.L. Li","year":"1997","unstructured":"C.L. Li and C.Y. Lee, \u201cScheduling with agreeable release times and due dates on a batch processing machine,\u201d European Journal of Operational Research, vol. 96, pp. 564-569, 1997.","journal-title":"European Journal of Operational Research"},{"key":"5149231_CR13","doi-asserted-by":"crossref","unstructured":"R. Uzsoy, \u201cScheduling batch processing machines with incompatible job families,\u201d International Journal of Production Research, pp. 2605-2708, 1995.","DOI":"10.1080\/00207549508904839"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027316504440.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1027316504440\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027316504440.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:41:39Z","timestamp":1751283699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1027316504440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5149231"],"URL":"https:\/\/doi.org\/10.1023\/a:1027316504440","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}