{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T01:10:33Z","timestamp":1771549833151,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":[[2002,4]]},"DOI":"10.1016\/s0167-6377(01)00115-8","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T19:55:37Z","timestamp":1034625337000},"page":"89-96","source":"Crossref","is-referenced-by-count":20,"title":["Randomized algorithms for on-line scheduling problems: how low can't you go?"],"prefix":"10.1016","volume":"30","author":[{"given":"Leen","family":"Stougie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjen P.A.","family":"Vestjens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00115-8_BIB1","doi-asserted-by":"crossref","unstructured":"F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 32\u201343.","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"10.1016\/S0167-6377(01)00115-8_BIB2","series-title":"Competitive Analysis of On-line Algorithms","author":"Borodin","year":"1998"},{"key":"10.1016\/S0167-6377(01)00115-8_BIB3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1006\/inco.1998.2775","article-title":"On randomization in online computation","volume":"150","author":"Borodin","year":"1999","journal-title":"Inform. Comput."},{"key":"10.1016\/S0167-6377(01)00115-8_BIB4","unstructured":"C. Chekuri, R. Motwani, B. Natarajan, C. Stein, Approximation techniques for average completion time scheduling, Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 609\u2013618."},{"key":"10.1016\/S0167-6377(01)00115-8_BIB5","unstructured":"E. Feuerstein, M. Mydlarz, L. Stougie, On-line multi-threaded scheduling problems, COSOR-Memorandum 99-21, Technische Universiteit Eindhoven, Eindhoven, 1999, To appear in J. Scheduling."},{"key":"10.1016\/S0167-6377(01)00115-8_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-6377(01)00115-8_BIB7","series-title":"Integer Programming and Combinatorial Optimization: Proceedings","first-page":"404","article-title":"Optimal on-line algorithms for single-machine scheduling","volume":"Vol. 1084","author":"Hoogeveen","year":"1996"},{"key":"10.1016\/S0167-6377(01)00115-8_BIB8","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/S0895480196296823","article-title":"A best possible deterministic on-line algorithm for minimizing delivery time on a single machine","volume":"13","author":"Hoogeveen","year":"2000","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0167-6377(01)00115-8_BIB9","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/S0097539796305778","article-title":"Approximability and nonapproximability results for minimizing total flow time on a single machine","volume":"28","author":"Kellerer","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(01)00115-8_BIB10","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, Vol. 4, North-Holland, Amsterdam, 1993, pp. 445\u2013552, (Chapter 9).","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0167-6377(01)00115-8_BIB11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01585872","article-title":"Minimizing average completion time in the presence of release dates","volume":"82","author":"Phillips","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00115-8_BIB12","doi-asserted-by":"crossref","unstructured":"S.S. Seiden, A guessing game and randomized online algorithms, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 592\u2013601.","DOI":"10.1145\/335305.335385"},{"key":"10.1016\/S0167-6377(01)00115-8_BIB13","doi-asserted-by":"crossref","unstructured":"J. Sgall, On-line scheduling, in: A. Fiat, G.J. Woeginger (Eds.), Online Algorithms: The State of the Art, Springer, Berlin, 1998, pp. 196\u2013231, (Chapter 9).","DOI":"10.1007\/BFb0029570"},{"key":"10.1016\/S0167-6377(01)00115-8_BIB14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/moor.25.1.63.15212","article-title":"A PTAS for minimizing the total weighted completion time on identical parallel machines","volume":"25","author":"Skutella","year":"2000","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00115-8_BIB15","unstructured":"L. Stougie, On-line minimizing sum of completion times, Manuscript, 1995."},{"key":"10.1016\/S0167-6377(01)00115-8_BIB16","unstructured":"E. Torng, P. Uthaisombut, Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling, Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 973\u2013974."},{"key":"10.1016\/S0167-6377(01)00115-8_BIB17","unstructured":"A.P.A. Vestjens, On-line machine scheduling problems, Ph.D. Thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, 1997."},{"key":"10.1016\/S0167-6377(01)00115-8_BIB18","doi-asserted-by":"crossref","unstructured":"A.C-C. Yao, Probabilistic computations: towards a unified measure of complexity, Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, 1977, pp. 222\u2013227.","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701001158?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701001158?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T17:51:28Z","timestamp":1556473888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701001158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0167637701001158"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00115-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}