{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T20:33:04Z","timestamp":1694809984534},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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,3]]},"DOI":"10.1016\/0305-0548(94)90094-9","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"329-336","source":"Crossref","is-referenced-by-count":10,"title":["A greedy heuristic for the mean tardiness sequencing problem"],"prefix":"10.1016","volume":"21","author":[{"given":"Adam","family":"Fadlalla","sequence":"first","affiliation":[]},{"given":"James R.","family":"Evans","sequence":"additional","affiliation":[]},{"given":"Martin S.","family":"Lew","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90094-9_BIB1","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"issue":"1","key":"10.1016\/0305-0548(94)90094-9_BIB2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/nav.3800210114","article-title":"An experimental comparison of solution algorithms for the single machine tardiness problem","volume":"21","author":"Baker","year":"1974","journal-title":"Naval Res. Lagist. Q."},{"key":"10.1016\/0305-0548(94)90094-9_BIB3","article-title":"Heuristic sequencing of single and multiple components","author":"Carroll","year":"1965"},{"key":"10.1016\/0305-0548(94)90094-9_BIB4","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/0305-0548(94)90094-9_BIB5","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one process is NP-hard","volume":"3","author":"Du","year":"1990","journal-title":"Math. Opns Res."},{"key":"10.1016\/0305-0548(94)90094-9_BIB6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","article-title":"A dual algorithm for the one machine scheduling problem","volume":"11","author":"Fisher","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/0305-0548(94)90094-9_BIB7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A \u201cpseudopolynomial\u201d algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0305-0548(94)90094-9_BIB8","article-title":"Sequencing with delay costs","author":"Montagne","year":"1969"},{"key":"10.1016\/0305-0548(94)90094-9_BIB9","series-title":"Design and Analysis of Experiments","author":"Montgomery","year":"1991"},{"key":"10.1016\/0305-0548(94)90094-9_BIB10","article-title":"Accurate myopic heuristics for tardiness scheduling","author":"Morton","year":"1984"},{"key":"10.1016\/0305-0548(94)90094-9_BIB11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","article-title":"A decomposition algorithm for the single machine total tardiness problem","volume":"1","author":"Potts","year":"1982","journal-title":"Opns Res. Lett."},{"key":"10.1016\/0305-0548(94)90094-9_BIB12","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1080\/07408179108963868","article-title":"Single machine tardiness sequencing heuristics","volume":"23","author":"Potts","year":"1991","journal-title":"IIE Trans."},{"issue":"No. 5","key":"10.1016\/0305-0548(94)90094-9_BIB13","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/opre.23.5.908","article-title":"Minimizing total costs in one machine scheduling","volume":"23","author":"Kan","year":"1975","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(94)90094-9_BIB14","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.26.3.444","article-title":"Dynamic programming solution of sequencing problems with precedence constraints","volume":"26","author":"Schrage","year":"1978","journal-title":"Opns Res."},{"issue":"No. 1","key":"10.1016\/0305-0548(94)90094-9_BIB15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0483(84)90011-2","article-title":"A state of the art survey of static scheduling research involving due dates","volume":"12","author":"Sen","year":"1984","journal-title":"Omega"},{"issue":"No. 3","key":"10.1016\/0305-0548(94)90094-9_BIB16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/nav.3800180304","article-title":"A hybrid algorithm for the one machine sequencing problem to minimize total tardiness","volume":"18","author":"Srinivasan","year":"1971","journal-title":"Naval Res. Logist. Q."},{"key":"10.1016\/0305-0548(94)90094-9_BIB17","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/05695557108974812","article-title":"An improved algorithm for scheduling independent tasks","volume":"3","author":"Wilkerson","year":"1971","journal-title":"AIIE Trans."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900949?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900949?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:26:15Z","timestamp":1552915575000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0305054894900949"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90094-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}