{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:26:51Z","timestamp":1769837211265,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,30]],"date-time":"2014-01-30T00:00:00Z","timestamp":1391040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-014-9706-4","type":"journal-article","created":{"date-parts":[[2014,1,29]],"date-time":"2014-01-29T10:47:03Z","timestamp":1390992423000},"page":"228-236","source":"Crossref","is-referenced-by-count":18,"title":["Online unbounded batch scheduling on parallel machines with delivery times"],"prefix":"10.1007","volume":"29","author":[{"given":"Peihai","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,30]]},"reference":[{"key":"9706_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1027316504440","volume":"7","author":"XT Deng","year":"2003","unstructured":"Deng XT, Poon CK, Zhang YZ (2003) Approximation algorithms in batch processing. J Comb Optim 7:247\u2013257","journal-title":"J Comb Optim"},{"key":"9706_CR2","doi-asserted-by":"crossref","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 (2011) Online batch scheduling on parallel machines with delivery times. Theor Comput Sci 412:5333\u20135339","journal-title":"Theor Comput Sci"},{"key":"9706_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawer EL, Lenstra JK (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discr Math 5:287\u2013326","journal-title":"Ann Discr Math"},{"key":"9706_CR4","doi-asserted-by":"crossref","unstructured":"Hall LA, Shmoys DB (1989) Approximation schemes for constrained scheduling problems. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science 134\u2013139","DOI":"10.1109\/SFCS.1989.63468"},{"key":"9706_CR5","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"JA Hoogeveen","year":"2000","unstructured":"Hoogeveen JA, Vestjean APA (2000) A best possible deterministic online algorithm for minimizing maximum delivery times on a single machine. SIAM J Discr Math 13:56\u201363","journal-title":"SIAM J Discr Math"},{"key":"9706_CR6","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee CY, Uzsoy R, Martin-Vega LA (1992) Efficient algorithms for scheduling semi-conductor burn-in operations. Oper Res 40:764\u2013775","journal-title":"Oper Res"},{"key":"9706_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"CY Lee","year":"1999","unstructured":"Lee CY, Uzsoy R (1999) Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int J Prod Res 37:219\u2013236","journal-title":"Int J Prod Res"},{"key":"9706_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10951-009-0154-4","volume":"15","author":"P Liu","year":"2012","unstructured":"Liu P, Lu X, Fang Y (2012) A best possible deterministic online algorithm for minimizing makespan on parallel batch machines. J Sched 15:77\u201381","journal-title":"J Sched"},{"key":"9706_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0166-218X(00)00181-5","volume":"105","author":"ZH Liu","year":"2000","unstructured":"Liu ZH, Yu WC (2000) Scheduling one batch processor subject to job release dates. Discr Appl Math 105:129\u2013136","journal-title":"Discr Appl Math"},{"key":"9706_CR10","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.orl.2008.03.004","volume":"36","author":"QQ Nong","year":"2008","unstructured":"Nong QQ, Cheng TCE, Ng CT (2008) An improved on-line algorithm for scheduling on two unresrtictive paralle batch processing machines. Oper Res Lett 36:584\u2013588","journal-title":"Oper Res Lett"},{"key":"9706_CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10878-005-6855-5","volume":"9","author":"CK Poon","year":"2005","unstructured":"Poon CK, Yu WC (2005) On-line scheduling algorithms for a batch machine with finite capacity. J Comb Optim 9:167\u2013186","journal-title":"J Comb Optim"},{"key":"9706_CR12","doi-asserted-by":"crossref","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 (2007) Online scheduling with delivery time on a single batch machine. Theor Comput Sci 374:49\u201357","journal-title":"Theor Comput Sci"},{"key":"9706_CR13","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1016\/j.ipl.2009.08.008","volume":"109","author":"J Tian","year":"2009","unstructured":"Tian J, Cheng TCE, Ng CT, Yuan J (2009) Online scheduling on unbounded parallel-batch machines to minimize the makespan. Inf Process Lett 109:1211\u20131215","journal-title":"Inf Process Lett"},{"key":"9706_CR14","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.dam.2011.12.002","volume":"160","author":"J Tian","year":"2012","unstructured":"Tian J, Cheng TCE, Ng CT, Yuan J (2012) An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discr Appl Math 160:1191\u20131210","journal-title":"Discr Appl Math"},{"key":"9706_CR15","unstructured":"Vestjens APA (1997) Online machine scheduling. Ph.D. Dissertation, Department of mathematics and Computing Science, Eindhoven University of Techology, Eindhoven, The Netherlands"},{"key":"9706_CR16","doi-asserted-by":"crossref","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 (2009) A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. J Comb Optim 17:206\u2013213","journal-title":"J Comb Optim"},{"key":"9706_CR17","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/nav.5","volume":"48","author":"G Zhang","year":"2001","unstructured":"Zhang G, Cai X, Wong CK (2001) On-line algorithms for minimizing makespan on batch processing machines. Nav Res Logist 48:241\u2013258","journal-title":"Nav Res Logist"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9706-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9706-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9706-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:22Z","timestamp":1559276602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9706-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,30]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9706"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9706-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,30]]}}}