{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T01:09:10Z","timestamp":1768525750395,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,12]],"date-time":"2010-02-12T00:00:00Z","timestamp":1265932800000},"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":[[2011,11]]},"DOI":"10.1007\/s10878-010-9298-6","type":"journal-article","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T20:54:13Z","timestamp":1265921653000},"page":"509-516","source":"Crossref","is-referenced-by-count":15,"title":["Optimal on-line algorithms for one batch machine with\u00a0grouped processing times"],"prefix":"10.1007","volume":"22","author":[{"given":"Yang","family":"Fang","sequence":"first","affiliation":[]},{"given":"Peihai","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,12]]},"reference":[{"key":"9298_CR1","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":"Brucker P, Gladky A, Hoogeveen H, Kovalyov MY, Potts CN, Tautenhahn T, van\u00a0de Velde SL (1998) Scheduling a batching machine. J Sched 1:31\u201354","journal-title":"J Sched"},{"key":"9298_CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1027316504440","volume":"7","author":"X Deng","year":"2003","unstructured":"Deng X, Poon CK, Zhang Y (2003) Approximation algorithms in batch processing. J Comb Optim 7:247\u2013257","journal-title":"J Comb Optim"},{"key":"9298_CR3","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"JA Hoogeveen","year":"2000","unstructured":"Hoogeveen JA, Vestjens APA (2000) A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM J Discrete Math 13:56\u201363","journal-title":"SIAM J Discrete Math"},{"key":"9298_CR4","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, MartinVega LA (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper Res 40:764\u2013775","journal-title":"Oper Res"},{"key":"9298_CR5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0166-218X(00)00181-5","volume":"105","author":"Z Liu","year":"2000","unstructured":"Liu Z, Yu W (2000) Scheduling one batch processor subject to job release dates. Discrete Appl Math 105:129\u2013136","journal-title":"Discrete Appl Math"},{"key":"9298_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10479-004-5031-0","volume":"133","author":"CK Poon","year":"2005","unstructured":"Poon CK, Yu W (2005) A flexible on-line scheduling algorithm for batch machine with infinite capacity. Ann Oper Res 133:175\u2013181","journal-title":"Ann Oper Res"},{"key":"9298_CR7","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 W (2005) On-line scheduling algorithms for a batch machine with finite capacity. J Comb Optim 9:167\u2013186","journal-title":"J Comb Optim"},{"key":"9298_CR8","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) On-line scheduling with delivery time on a single batch machine. Theory Comput Sci 374:49\u201357","journal-title":"Theory Comput Sci"},{"key":"9298_CR9","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":"9298_CR10","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-010-9298-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9298-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9298-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9298-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9298"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9298-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,12]]}}}