{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:42:51Z","timestamp":1725453771530},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_12","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T00:31:28Z","timestamp":1368750688000},"page":"114-121","source":"Crossref","is-referenced-by-count":0,"title":["Online Algorithms for Batch Machines Scheduling with Delivery Times"],"prefix":"10.1007","author":[{"given":"Peihai","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1027316504440","volume":"7","author":"X.T. Deng","year":"2003","unstructured":"Deng, X.T., Poon, C.K., Zhang, Y.Z.: Approximation algorithms in batch processing. Journal of Combinatorial Optimization\u00a07, 247\u2013257 (2003)","journal-title":"Journal of Combinatorial Optimization"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"5333","DOI":"10.1016\/j.tcs.2011.06.011","volume":"412","author":"Y. Fang","year":"2011","unstructured":"Fang, Y., Lu, X., Liu, P.: Online batch scheduling on parallel machines with delivery times. Theoretical Computer Science\u00a0412, 5333\u20135339 (2011)","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawer, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Hall, L.A., Shmoys, D.B.: Approximation schemes for constrained scheduling problems. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 134\u2013139 (1989)","DOI":"10.1109\/SFCS.1989.63468"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"J.A. Hoogeveen","year":"2000","unstructured":"Hoogeveen, J.A., Vestjean, A.P.A.: A best possible deterministic online algorithm for minimizing maximum delivery times on a single machine. SIAM Journal on Discrete Mathematics\u00a013, 56\u201363 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"12_CR6","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 semi-conductor burn-in operations. Operations Research\u00a040, 764\u2013775 (1992)","journal-title":"Operations Research"},{"key":"12_CR7","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"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10951-009-0154-4","volume":"15","author":"P. Liu","year":"2012","unstructured":"Liu, P., Lu, X., Fang, Y.: A best possible deterministic online algorithm for minimizing makespan on parallel batch machines. Journal of Scheduling\u00a015(1), 77\u201381 (2012)","journal-title":"Journal of Scheduling"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(00)00181-5","volume":"105","author":"Z.H. Liu","year":"2000","unstructured":"Liu, Z.H., Yu, W.C.: Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics\u00a0105, 129\u2013136 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.orl.2008.03.004","volume":"36","author":"Q.Q. Nong","year":"2008","unstructured":"Nong, Q.Q., Cheng, T.C.E., Ng, C.T.: An improved on-line algorithm for scheduling on two unresrtictive paralle batch processing machines. Operations Research Letters\u00a036, 584\u2013588 (2008)","journal-title":"Operations Research Letters"},{"key":"12_CR11","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.C.: On-line scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization\u00a09, 167\u2013186 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2006.12.001","volume":"374","author":"J. Tian","year":"2007","unstructured":"Tian, J., Fu, R., Yuan, J.: Online scheduling with delivery time on a single batch machine. Theory Computer Science\u00a0374, 49\u201357 (2007)","journal-title":"Theory Computer Science"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1016\/j.ipl.2009.08.008","volume":"109","author":"J. Tian","year":"2009","unstructured":"Tian, J., Cheng, T.C.E., Ng, C., Yuan, J.: Online scheduling on unbounded parallel-batch machines to minimize the makespan. Information Processing Letters\u00a0109, 1211\u20131215 (2009)","journal-title":"Information Processing Letters"},{"key":"12_CR14","unstructured":"Vestjens, A.P.A.: Online machine scheduling. Ph.D. thesis, Department of mathematics and Computing Science, Eindhoven University of Techology, Eindhoven, The Netherlands (1997)"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s10878-007-9108-y","volume":"17","author":"J. Yuan","year":"2009","unstructured":"Yuan, J., Li, S., Tian, J., Fu, R.: A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. Jounrnal of Combinatorial Optimization\u00a017, 206\u2013213 (2009)","journal-title":"Jounrnal of Combinatorial Optimization"},{"key":"12_CR16","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","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T21:21:24Z","timestamp":1548624084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}