{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T02:30:27Z","timestamp":1768617027699,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,12,31]],"date-time":"2009-12-31T00:00:00Z","timestamp":1262217600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10951-009-0154-4","type":"journal-article","created":{"date-parts":[[2009,12,30]],"date-time":"2009-12-30T14:46:52Z","timestamp":1262184412000},"page":"77-81","source":"Crossref","is-referenced-by-count":40,"title":["A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines"],"prefix":"10.1007","volume":"15","author":[{"given":"Peihai","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Fang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,31]]},"reference":[{"key":"154_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., Kovalyvov, M. Y., Potts, C. N., Tautehahn, T., & Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31\u201354.","journal-title":"Journal of Scheduling"},{"key":"154_CR2","first-page":"380","volume-title":"Lecture notes in computer science","author":"B. Chen","year":"2001","unstructured":"Chen, B., Deng, X., & Zang, W. (2001). On-line scheduling a batch processing system to minimize total weighted job completion time. In Lecture notes in computer science (Vol.\u00a02223, pp. 380\u2013389). Berlin: Springer."},{"key":"154_CR3","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1002\/nav.20035","volume":"51","author":"T. C. E. Cheng","year":"2004","unstructured":"Cheng, T. C. E., Ng, C. T., Yuan, J. J., & Liu, Z. H. (2004). Single machine parallel batch scheduling subject to precedence constraints. Naval Research Logistics, 51, 949\u2013958.","journal-title":"Naval Research Logistics"},{"key":"154_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.\u00a0L. Graham","year":"1979","unstructured":"Graham, R.\u00a0L., Lawler, E.\u00a0L., Lenstra, J.\u00a0K., & Rinnooy\u00a0Kan,\u00a0A.\u00a0H.\u00a0G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals Discrete Mathematics"},{"key":"154_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"C. Y. Lee","year":"1999","unstructured":"Lee, C. Y., & Uzsoy, R. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37, 219\u2013236.","journal-title":"International Journal of Production Research"},{"key":"154_CR6","doi-asserted-by":"crossref","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. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40, 764\u2013775.","journal-title":"Operations Research"},{"key":"154_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.orl.2004.04.009","volume":"33","author":"S. Li","year":"2005","unstructured":"Li, S., Li, G., Wang, X., & Liu, Q. (2005). Minimizing makespan on a single batching machine with release times and non-identical job sizes. Operations Research Letters, 33, 157\u2013164.","journal-title":"Operations Research Letters"},{"key":"154_CR8","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 Applied Mathematics, 105, 129\u2013136.","journal-title":"Discrete Applied Mathematics"},{"key":"154_CR9","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0167-6377(01)00105-5","volume":"30","author":"C. T. Ng","year":"2002","unstructured":"Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2002). A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. Operations Research Letters, 30, 66\u201368.","journal-title":"Operations Research Letters"},{"key":"154_CR10","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1023\/A:1024858623282","volume":"6","author":"C. T. Ng","year":"2003","unstructured":"Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2003). The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard. Journal of Scheduling, 6, 483\u2013490.","journal-title":"Journal of Scheduling"},{"key":"154_CR11","doi-asserted-by":"crossref","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. (2008). An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. Operations Research Letters, 36, 584\u2013588.","journal-title":"Operations Research Letters"},{"key":"154_CR12","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1016\/j.tcs.2009.02.011","volume":"410","author":"J. Tian","year":"2009","unstructured":"Tian, J., Fu, R., & Yuan, J. (2009). A best online algorithm for scheduling on two parallel batch machines. Theoretical Computer Science, 410, 2291\u20132294.","journal-title":"Theoretical Computer Science"},{"key":"154_CR13","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R. Uzsoy","year":"1994","unstructured":"Uzsoy, R. (1994). A single batch processing machine with non-identical job sizes. International Journal of Production Research, 32, 1615\u20131635.","journal-title":"International Journal of Production Research"},{"key":"154_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.tcs.2004.01.038","volume":"320","author":"J. J. Yuan","year":"2004","unstructured":"Yuan, J. J., Liu, Z. H., Ng, C. T., & Cheng, T. C. E. (2004). The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theoretical Computer Science, 320, 199\u2013212.","journal-title":"Theoretical Computer Science"},{"key":"154_CR15","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, C. K. (2001). On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, 48, 241\u2013258.","journal-title":"Naval Research Logistics"},{"key":"154_CR16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/07408170304378","volume":"35","author":"G. Zhang","year":"2003","unstructured":"Zhang, G., Cai, X., & Wong, C. K. (2003). Optimal on-line algorithms for scheduling on parallel batch processing machines. IIE Transactions, 35, 175\u2013181.","journal-title":"IIE Transactions"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0154-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0154-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0154-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:44Z","timestamp":1559453984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0154-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,31]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["154"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0154-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,31]]}}}