{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:24:00Z","timestamp":1725495840821},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669166"},{"type":"electronic","value":"9783540466321"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46632-0_16","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T19:45:01Z","timestamp":1195933501000},"page":"153-162","source":"Crossref","is-referenced-by-count":10,"title":["Approximation Algorithms in Batch Processing"],"prefix":"10.1007","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","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"16_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. Batching and scheduling jobs on batch and discrete processors. Operations Research, 40:750\u2013763, 1992.","journal-title":"Operations Research"},{"key":"16_CR2","unstructured":"J.J. Bartholdi. unpublished manuscript, 1988."},{"key":"16_CR3","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":"P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn, and S.L. van de Velde. Scheduling a batching machine. Journal of Scheduling, 1:31\u201354, 1998.","journal-title":"Journal of Scheduling"},{"key":"16_CR4","doi-asserted-by":"publisher","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. Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13:61\u201365, 1993.","journal-title":"Operations Research Letters"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"2097","DOI":"10.1080\/00207549308956847","volume":"31","author":"V. Chandru","year":"1993","unstructured":"V. Chandru, C.Y. Lee, and R. Uzsoy. Minimizing total completion time on batch processing machines. International Journal of Production Research, 31:2097\u20132121, 1993.","journal-title":"International Journal of Production Research"},{"key":"16_CR6","unstructured":"G. Dobson and R.S. Nambinadom. The batch loading scheduling problem. Technical report, Simon Graduate School of Business Administration, University of Rochester, 1992."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"C.R. Glassey and W.W. Weng. Dynamic batching heuristics for simultaneous processing. IEEE Transactions on Semiconductor Manufacturing, pages 77\u201382, 1991.","DOI":"10.1109\/66.79719"},{"key":"16_CR8","first-page":"387","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"R.L. Graham, Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics, 5:387\u2013326, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y. Ikura","year":"1986","unstructured":"Y. Ikura and M. Gimple. Scheduling algorithm for a single batch processing machine. Operations Research Letters, 5:61\u201365, 1986.","journal-title":"Operations Research Letters"},{"key":"16_CR10","unstructured":"C.Y. Lee and R. Uzsoy. Minimizing makespan on a single batch processing machine with dynamic job arrivals. Technical report, Department of Industrial and System Engineering, University of Florida, January 1996."},{"key":"16_CR11","doi-asserted-by":"publisher","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. Martin Vega. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40:764\u2013775, 1992.","journal-title":"Operations Research"},{"key":"16_CR12","doi-asserted-by":"publisher","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. Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research, 96:564\u2013569, 1997.","journal-title":"European Journal of Operational Research"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"R. Uzsoy. Scheduling batch processing machines with incompatible job families. International Journal of Production Research, pages 2605\u20132708, 1995.","DOI":"10.1080\/00207549508904839"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46632-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T21:40:14Z","timestamp":1551130814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46632-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669166","9783540466321"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46632-0_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}