{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:40:00Z","timestamp":1743018000509,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_32","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"346-353","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine"],"prefix":"10.1007","author":[{"given":"Ming","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1027316504440","volume":"7","author":"X. Deng","year":"2003","unstructured":"Deng, X., Poon, C.K., Zhang, Y.: Approximation Algorithms in Batch Processing. Journal of Combinatorial Optimization\u00a07, 247\u2013257 (2003)","journal-title":"Journal of Combinatorial Optimization"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.orl.2007.07.001","volume":"36","author":"R. Fu","year":"2008","unstructured":"Fu, R., Tian, J., Yuan, J., He, C.: On-Line Scheduling on a Batch Machine to Minimize Makespan with Limited Restarts. Operational Research Letters\u00a036, 255\u2013258 (2008)","journal-title":"Operational Research Letters"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.tcs.2006.12.040","volume":"374","author":"R. Fu","year":"2007","unstructured":"Fu, R., Tian, J., Yuan, J., Lin, Y.: On-Line Scheduling in a Parallel Batch Processing System to Minimize Makespan Using Restarts. Theoretical Computer Science\u00a0374, 196\u2013202 (2007)","journal-title":"Theoretical Computer Science"},{"key":"32_CR5","unstructured":"Pruhs, K., Sgall, J., Torng, E.: Online Scheduling. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004)"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"C.Y. Lee","year":"1999","unstructured":"Lee, C.Y., Uzsoy, R.: Minimizing Makespan on a Single Batch Processing Machine with Dynamic Job Arrivals. International Journal of Production Research\u00a037, 219\u2013236 (1999)","journal-title":"International Journal of Production Research"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C.Y. Lee","year":"1992","unstructured":"Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient Algorithms for Scheduling Semiconductor Burn-in Operations. Operations Research\u00a040, 764\u2013775 (1992)","journal-title":"Operations Research"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ijpe.2006.12.061","volume":"111","author":"Q. Nong","year":"2008","unstructured":"Nong, Q., Yuan, J., Fu, R., Lin, L., Tian, J.: The Single-Machine Parallel-Batching On-Line Scheduling Problem with Family Jobs to Minimize Makespan. International Journal of Production Economics\u00a0111, 435\u2013440 (2008)","journal-title":"International Journal of Production Economics"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10878-005-6855-5","volume":"9","author":"C.K. Poon","year":"2005","unstructured":"Poon, C.K., Yu, W.: Online Scheduling Algorithms for a Batch Machine with Finite Capacity. Journal of Combinatorial Optimization\u00a09, 167\u2013186 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/nav.5","volume":"48","author":"G. Zhang","year":"2001","unstructured":"Zhang, G., Cai, X., Wong, C.: On-Line Algorithms for Minimizing Makespan on Batch Processing Machines. Naval Research Logistics\u00a048, 241\u2013258 (2001)","journal-title":"Naval Research Logistics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:56:08Z","timestamp":1714622168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}