{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T03:08:55Z","timestamp":1776136135123,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":[[2001,10]]},"DOI":"10.1016\/s0167-6377(01)00099-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:28:48Z","timestamp":1027607328000},"page":"141-148","source":"Crossref","is-referenced-by-count":20,"title":["Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates"],"prefix":"10.1016","volume":"29","author":[{"given":"Philip","family":"Kaminsky","sequence":"first","affiliation":[]},{"given":"David","family":"Simchi-Levi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00099-2_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)00099-2_BIB2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0166-218X(92)90255-9","article-title":"Scheduling with release dates on a single machine to total weighted completion time","volume":"36","author":"Beloudadah","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(01)00099-2_BIB3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/nav.3800290114","article-title":"Scheduling of a single machine to minimize total weighted completion time subject to release dates","volume":"29","author":"Bianco","year":"1982","journal-title":"Nav. Res. Logistics Quart."},{"key":"10.1016\/S0167-6377(01)00099-2_BIB4","unstructured":"C. Chekuri, R. Motwani, B. Natarajan, C. Stein, Approximation techniques for average completion time scheduling, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 609\u2013618."},{"key":"10.1016\/S0167-6377(01)00099-2_BIB5","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/0210014","article-title":"Sequencing jobs with unequal ready times to minimize mean flow time","volume":"10","author":"Dessouky","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(01)00099-2_BIB6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","article-title":"Formulating the single machine sequencing problem with release dates as a mixed integer program","volume":"26","author":"Dyer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(01)00099-2_BIB7","doi-asserted-by":"crossref","unstructured":"Gazmuri, Probabilistic analysis of a machine scheduling problem, Math. Oper. Res. 10 (1985) 328\u2013339.","DOI":"10.1287\/moor.10.2.328"},{"key":"10.1016\/S0167-6377(01)00099-2_BIB8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0166-218X(83)90019-7","article-title":"An algorithm for single machine sequencing with release dates to minimize total weighted completion time","volume":"5","author":"Hariri","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(01)00099-2_BIB9","doi-asserted-by":"crossref","unstructured":"J.A. Hoogeveen, A.P.A. Vestjens, Optimal on-line algorithms for single-machine scheduling, Proceedings of the Fifth Conference on Integer Programming and Combinatorial Optimization, 1996, pp. 404\u2013414.","DOI":"10.1007\/3-540-61310-2_30"},{"key":"10.1016\/S0167-6377(01)00099-2_BIB10","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1287\/opre.46.6.872","article-title":"Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem","volume":"46","author":"Kaminsky","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00099-2_BIB11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1287\/opre.49.2.293.13536","article-title":"The asymptotic optimality of the SPT rule for the flow shop mean completion time problem","volume":"49","author":"Kaminsky","year":"2001","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00099-2_BIB12","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(01)00099-2_BIB13","doi-asserted-by":"crossref","unstructured":"C. Phillips, C. Stein, J. Wein, Scheduling jobs that arrive over time, Math. Programming B 82 (1998) 199\u2013223.","DOI":"10.1007\/BF01585872"},{"key":"10.1016\/S0167-6377(01)00099-2_BIB14","series-title":"Scheduling: Theory, Algorithms and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0167-6377(01)00099-2_BIB15","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/opre.16.3.687","article-title":"A proof of the optimality of the shortest remaining processing time discipline","volume":"16","author":"Schrage","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00099-2_BIB16","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01586059","article-title":"A time indexed formulation of non-preemptive single machine scheduling problems","volume":"54","author":"Sousa","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00099-2_BIB17","unstructured":"J.M. van den Akker, LP-based solution methods for single-machine scheduling problems, Ph. D. Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, 1994."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000992?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000992?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T07:53:40Z","timestamp":1556438020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000992"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0167637701000992"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00099-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}