{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:47:02Z","timestamp":1770972422275,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0305-0548(94)90034-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"1041-1050","source":"Crossref","is-referenced-by-count":19,"title":["A look-ahead heuristic for scheduling jobs with release dates on a single machine"],"prefix":"10.1016","volume":"21","author":[{"given":"Weizhen","family":"Mao","sequence":"first","affiliation":[]},{"given":"Rex K.","family":"Kincaid","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90034-5_BIB1","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1990"},{"key":"10.1016\/0305-0548(94)90034-5_BIB2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-state production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Q."},{"key":"10.1016\/0305-0548(94)90034-5_BIB3","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\/0305-0548(94)90034-5_BIB4","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0305-0548(94)90034-5_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 Jl Comput."},{"key":"10.1016\/0305-0548(94)90034-5_BIB6","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1093\/comjnl\/26.4.320","article-title":"On scheduling with ready times to minimize mean flow time","volume":"26","author":"Deogun","year":"1983","journal-title":"Comput. J."},{"key":"10.1016\/0305-0548(94)90034-5_BIB7","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/moor.10.2.328","article-title":"Probabilistic analysis of a machine scheduling problem","volume":"10","author":"Gazmuri","year":"1985","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0305-0548(94)90034-5_BIB8","series-title":"Proc. 30th Annu. ACM Southeast Conf.","first-page":"253","article-title":"The utility of foresight in single server scheduling","author":"Rifkin","year":"1992"},{"key":"10.1016\/0305-0548(94)90034-5_BIB9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0167-6377(92)90092-H","article-title":"Efficient heuristics to minimize total flow time with release dates","volume":"12","author":"Chu","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0305-0548(94)90034-5_BIB10","unstructured":"W. Mao, R. K. Kincaid and A. Rifkin, On-line scheduling algorithms. In The Impact of Emerging Technologies on Computer Science and Operations Research (Edited by A. Sofer and S. Nash)."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900345?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900345?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:28:10Z","timestamp":1552930090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":10,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0305054894900345"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90034-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}