{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:02:24Z","timestamp":1777608144105,"version":"3.51.4"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":[[2003,5]]},"DOI":"10.1016\/s0167-6377(03)00016-6","type":"journal-article","created":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T00:16:29Z","timestamp":1048637789000},"page":"232-236","source":"Crossref","is-referenced-by-count":48,"title":["A class of on-line scheduling algorithms to minimize total completion time"],"prefix":"10.1016","volume":"31","author":[{"given":"X.","family":"Lu","sequence":"first","affiliation":[]},{"given":"R.A.","family":"Sitters","sequence":"additional","affiliation":[]},{"given":"L.","family":"Stougie","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(03)00016-6_BIB1","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 minimizinge average weighted completion time with release dates, Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, New York City, NY, October 1999."},{"key":"10.1016\/S0167-6377(03)00016-6_BIB2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/S0097539797327180","article-title":"Approximation techniques for average completion time scheduling","volume":"31","author":"Chekuri","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(03)00016-6_BIB3","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/S0167-6377(03)00016-6_BIB4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(90)90100-V","article-title":"Minimizing mean flow time with release time constraint","volume":"75","author":"Du","year":"1990","journal-title":"Theoretical Comput. Sci."},{"key":"10.1016\/S0167-6377(03)00016-6_BIB5","doi-asserted-by":"crossref","unstructured":"J.A. Hoogeveen, A.P.A. Vestjens, Optimal on-line algorithms for single-machine scheduling, Proceedings Fifth International Conference on Integer Programming and Combinatorial Optimization, Vancouver, British Columbia, Canada, June 3\u20135, 1996, Lecture Notes in Computer Science, Vol. 1084, Springer, Berlin, 1996, pp. 404\u2013414.","DOI":"10.1007\/3-540-61310-2_30"},{"key":"10.1016\/S0167-6377(03)00016-6_BIB6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(03)00016-6_BIB7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0025-5610(97)00093-2","article-title":"Minimizing average completion time in the presence of release dates, networks and matroids; Sequencing and scheduling","volume":"82","author":"Phillips","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(03)00016-6_BIB8","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/opre.16.3.687","article-title":"A proof of the shortest remaining processing time processing discipline","volume":"16","author":"Schrage","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(03)00016-6_BIB9","series-title":"Online 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(03)00016-6_BIB10","unstructured":"A.P.A. Vestjens, On-line Machine Scheduling, Ph.D. Thesis, Department of Mathematics and Computing Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands, 1997."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000166?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000166?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T05:21:15Z","timestamp":1553664075000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637703000166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167637703000166"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(03)00016-6","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}