{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:58:58Z","timestamp":1742972338245,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_75","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"872-883","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts"],"prefix":"10.1007","author":[{"given":"Rob","family":"van Stee","sequence":"first","affiliation":[]},{"given":"Han La","family":"Outr\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"75_CR1","unstructured":"C. Chekuri, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 609\u2013618, New York \/ Philadelphia, 1997. ACM \/ SIAM."},{"key":"75_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-44683-4_30","volume-title":"Lower bounds for on-line single-machine scheduling","author":"L. Epstein","year":"2001","unstructured":"Leah Epstein and Rob vanStee. Lower bounds for on-line single-machine scheduling.In Proc. 26th Symp. on Mathematical Foundations of Computer Science, volume 2136 of Lecture Notes in Computer Science, pages 338\u2013350, 2001."},{"key":"75_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0167-6377(00)00061-4","volume":"27","author":"H. Hoogeveen","year":"2000","unstructured":"H. Hoogeveen, C. N. Potts, and G. J. Woeginger. On-line scheduling on a single machine: maximizing the number of early jobs. Operations Research Letters, 27:193\u2013197, 2000.","journal-title":"Operations Research Letters"},{"key":"75_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-61310-2_30","volume-title":"Integer Programming and Combinatorial Optimization","author":"J. A. Hoogeveen","year":"1996","unstructured":"J. A. Hoogeveen and A. P. A. Vestjens. Optimal on-line algorithms for single-machine scheduling. In W.H. Cunningham, S. T. McCormick, and M. Queyranne,editors, Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Proceedings, volume 1084 of Lecture Notes in Computer Science,pages 404\u2013414. Springer, 1996."},{"key":"75_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-60220-8_53","volume-title":"Scheduling jobs that arrive over time","author":"C. A. Phillips","year":"1995","unstructured":"C. A. Phillips, C. Stein, and J. Wein. Scheduling jobs that arrive over time. In Proceedings of the 4th Workshop on Al gorithms and Data Structures (WADS\u201995), volume 955 of Lecture Notes in Computer Science, pages 86\u201397. Springer, 1995."},{"key":"75_CR6","doi-asserted-by":"crossref","unstructured":"David B. Shmoys, Joel Wein, and David P. Williamson. Scheduling parallel machines on-line. In Lyle A. McGeoch and Daniel D. Sleator, editors, On-line Algorithms, volume 7 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 163\u2013166. AMS\/ACM, 1991.","DOI":"10.1090\/dimacs\/007\/13"},{"key":"75_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. E. Smith","year":"1956","unstructured":"W. E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59\u201366, 1956.","journal-title":"Naval Research Logistics Quarterly"},{"key":"75_CR8","unstructured":"L. Stougie. Unpublished manuscript, 1995."},{"key":"75_CR9","unstructured":"L. Stougie and A. P. A. Vestjens. Randomized on-line scheduling: How low can\u2019t you go? Unpublished manuscript."},{"key":"75_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/1099-1425(200011\/12)3:6<333::AID-JOS53>3.0.CO;2-8","volume":"3","author":"M. van den Akker","year":"2000","unstructured":"Marjan van den Akker, Han Hoogeveen, and Nodari Vakhania. Restarts can help in the on-line minimization of the maximum delivery time on a single machine. Journal of Scheduling, 3:333\u2013341, 2000.","journal-title":"Journal of Scheduling"},{"key":"75_CR11","doi-asserted-by":"crossref","unstructured":"R. van Stee and J. A. La Poutr\u00e9. Minimizing the total completion time on a single on-line machine, using restarts. Technical Report SEN-R0211, CWI, Amsterdam, June 2002.","DOI":"10.1007\/3-540-45749-6_75"},{"key":"75_CR12","unstructured":"Arjen P. A. Vestjens. On-line Machine Scheduling. PhD thesis, Eindhoven University of Technology, The Netherlands, 1997."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T02:01:12Z","timestamp":1676685672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45749-6_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_75","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"29 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}