{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:21:02Z","timestamp":1777965662967,"version":"3.51.4"},"reference-count":9,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0167-6377(00)00061-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:05:54Z","timestamp":1027616754000},"page":"193-197","source":"Crossref","is-referenced-by-count":46,"title":["On-line scheduling on a single machine: maximizing the number of early jobs"],"prefix":"10.1016","volume":"27","author":[{"given":"Han","family":"Hoogeveen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(00)00061-4_BIB1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0167-6377(98)00045-5","article-title":"An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs","volume":"24","author":"Baptiste","year":"1999","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(00)00061-4_BIB2","doi-asserted-by":"crossref","unstructured":"S. Baruah, J. Haritsa, N. Sharma, On-line scheduling to maximize task completions, Proceedings of the 15th IEEE Real-time Systems Symposium (RSS\u201996), 1994, pp. 228\u2013237.","DOI":"10.1109\/REAL.1994.342713"},{"key":"10.1016\/S0167-6377(00)00061-4_BIB3","unstructured":"B. Kalyanasundaram, K. Pruhs, Maximizing job completions on-line, Proceedings of the Sixth European Symposium on Algorithms (ESA\u201998), Springer Lecture Notes in Computer Science, vol. 1461, 1998, pp. 235\u2013246."},{"key":"10.1016\/S0167-6377(00)00061-4_BIB4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02248588","article-title":"A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs","volume":"26","author":"Lawler","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(00)00061-4_BIB5","first-page":"343","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(00)00061-4_BIB6","series-title":"On-line Algorithms: The State of the Art","first-page":"196","article-title":"On-line scheduling","volume":"vol. 1442","author":"Sgall","year":"1998"},{"key":"10.1016\/S0167-6377(00)00061-4_BIB7","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/S0097539793248317","article-title":"Scheduling parallel machines on-line","volume":"24","author":"Shmoys","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(00)00061-4_BIB8","doi-asserted-by":"crossref","unstructured":"J.M. van den Akker, J.A. Hoogeveen, N. Vakhania, Restarts can help in the on-line minimization of the maximum delivery time on a single machine, Proceedings of the Eighth European Symposium on Algorithms (ESA\u20192000), Lecture Notes in Computer Science, vol. 1879, Springer, Berlin, 2000.","DOI":"10.1007\/3-540-45253-2_39"},{"key":"10.1016\/S0167-6377(00)00061-4_BIB9","unstructured":"A.P.A. Vestjens, On-line machine scheduling, Ph.D. Thesis, Eindhoven University of Technology, 1997."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637700000614?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637700000614?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:28:25Z","timestamp":1555770505000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637700000614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0167637700000614"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(00)00061-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}