{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T02:20:20Z","timestamp":1705458020373},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,15]],"date-time":"2010-04-15T00:00:00Z","timestamp":1271289600000},"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":[[2011,8]]},"DOI":"10.1007\/s10951-010-0172-2","type":"journal-article","created":{"date-parts":[[2010,4,14]],"date-time":"2010-04-14T15:15:46Z","timestamp":1271258146000},"page":"361-369","source":"Crossref","is-referenced-by-count":16,"title":["A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan"],"prefix":"10.1007","volume":"14","author":[{"given":"Jinjiang","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Ruyan","family":"Fu","sequence":"additional","affiliation":[]},{"given":"C. T.","family":"Ng","sequence":"additional","affiliation":[]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,15]]},"reference":[{"key":"172_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, M. Y., Potts, C. N., Tautenhahn, T., & van\u00a0de Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31\u201354.","journal-title":"Journal of Scheduling"},{"key":"172_CR2","doi-asserted-by":"crossref","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. (2003). Approximation algorithms in batch processing. Journal of Combinatorial Optimization, 7, 247\u2013257.","journal-title":"Journal of Combinatorial Optimization"},{"key":"172_CR3","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0304-3975(02)00488-7","volume":"299","author":"L. Epstein","year":"2003","unstructured":"Epstein, L., & Stee, R. V. (2003). Lower bounds for on-line single-machine scheduling. Theoretical Computer Science, 299, 439\u2013450.","journal-title":"Theoretical Computer Science"},{"key":"172_CR4","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tcs.2006.12.040","volume":"374","author":"R. Y. Fu","year":"2007","unstructured":"Fu, R. Y., Tian, J., Yuan, J. J., & Lin, Y. X. (2007). On-line scheduling in a parallel batch processing system to minimize makespan using restarts. Theoretical Computer Science, 374, 196\u2013202.","journal-title":"Theoretical Computer Science"},{"key":"172_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.orl.2007.07.001","volume":"36","author":"R. Y. Fu","year":"2008","unstructured":"Fu, R. Y., Tian, J., Yuan, J. J., & He, C. (2008). On-line scheduling on a batch machine to minimize makespan with limited restarts. Operations Research Letters, 36, 255\u2013258.","journal-title":"Operations Research Letters"},{"key":"172_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0167-6377(00)00061-4","volume":"27","author":"H. Hoogeveen","year":"2000","unstructured":"Hoogeveen, H., Potts, C. N., & Woeginger, G. J. (2000). On-line scheduling on a single machine: Maximizing the number of early jobs. Operations Research Letters, 27, 193\u2013197.","journal-title":"Operations Research Letters"},{"key":"172_CR7","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1504\/IJSTL.2010.029894","volume":"2","author":"I. N. Lagoudis","year":"2010","unstructured":"Lagoudis, I. N., Fragkos, S. N., & Litinas, N. A. (2010). Estimating optimum container and vessel fleet sizes in a cyclic liner service using a holistic approach. International Journal of Shipping and Transport Logistics, 2, 4\u201321.","journal-title":"International Journal of Shipping and Transport Logistics"},{"key":"172_CR8","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":"172_CR9","doi-asserted-by":"crossref","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. (2005). On-line scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization, 9, 167\u2013186.","journal-title":"Journal of Combinatorial Optimization"},{"key":"172_CR10","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1504\/IJSTL.2010.029896","volume":"2","author":"D. P. Song","year":"2010","unstructured":"Song, D. P., Dong, J. X., & Roe, M. (2010). Optimal container dispatching policy and its structure in a shuttle service with finite capacity and random demands. International Journal of Shipping and Transport Logistics, 2, 44\u201358.","journal-title":"International Journal of Shipping and Transport Logistics"},{"key":"172_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jalgor.2004.10.001","volume":"57","author":"R. V. Stee","year":"2005","unstructured":"Stee, R. V., & Poutre, H. L. (2005). Minimizing the total completion time on-line on a single machine, using restarts. Journal of Algorithms, 57, 95\u2013129.","journal-title":"Journal of Algorithms"},{"key":"172_CR12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/1099-1425(200011\/12)3:6<333::AID-JOS53>3.0.CO;2-8","volume":"3","author":"M. Akker van\u00a0den","year":"2000","unstructured":"van\u00a0den Akker, M., Hoogeveen, H., & Vakhania, N. (2000). Restarts can help in the on-line minimization of the maximum delivery time on a single machine. Journal of Scheduling, 3, 333\u2013341.","journal-title":"Journal of Scheduling"},{"key":"172_CR13","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"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0172-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0172-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0172-2","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-010-0172-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,15]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["172"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0172-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,15]]}}}