{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:14:12Z","timestamp":1770992052360,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1016\/0167-6377(94)90069-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"199-208","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs"],"prefix":"10.1016","volume":"16","author":[{"given":"Awi","family":"Federgruen","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(94)90069-8_BIB1","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1002\/1520-6750(198710)34:5<739::AID-NAV3220340513>3.0.CO;2-3","article-title":"Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties","volume":"34","author":"Bagchi","year":"1987","journal-title":"Naval Res. Logist."},{"key":"10.1016\/0167-6377(94)90069-8_BIB2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/nav.3800330206","article-title":"Minimizing mean absolute deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1986","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0167-6377(94)90069-8_BIB3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tradiness penalties: a review","volume":"38","author":"Baker","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(94)90069-8_BIB4","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize floats: An analytic study of exact and approximate algorithms","volume":"23","author":"Cornuejols","year":"1977","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(94)90069-8_BIB5","series-title":"Efficient algorithms for scheduling problems with general earliness and tradiness cost structures","author":"Federgruen","year":"1991"},{"key":"10.1016\/0167-6377(94)90069-8_BIB6","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1002\/1520-6750(199312)40:7<951::AID-NAV3220400707>3.0.CO;2-1","article-title":"Simultaneous optimization of efficiency and performance balance measures in single machine scheduling problems","volume":"40","author":"Federgruen","year":"1993","journal-title":"Naval Res. Logist."},{"key":"10.1016\/0167-6377(94)90069-8_BIB7","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","article-title":"Deviation of completion times about a restrictive common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(94)90069-8_BIB8","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0377-2217(93)90181-L","article-title":"Scheduling with monotonous earliness and tardiness penalties","volume":"64","author":"Kahlbacher","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/0167-6377(94)90069-8_BIB9","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1002\/nav.3800280411","article-title":"Minimizing the average deviation of job completion-times about a common due date","volume":"28","author":"Kanet","year":"1981","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0167-6377(94)90069-8_BIB10","series-title":"Technical Report","article-title":"Deterministic and random single machine scheduling with due dates and general penalty functions","author":"Krieger","year":"1988"},{"key":"10.1016\/0167-6377(94)90069-8_BIB11","series-title":"The completion time variance minimization as a submodular function maximization","author":"Kubiak","year":"1989"},{"key":"10.1016\/0167-6377(94)90069-8_BIB12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","article-title":"Completion time variance minimization on a single machine is difficult","volume":"14","author":"Kubiak","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(94)90069-8_BIB13","article-title":"Error Bound of a Heuristic for the common due date scheduling problem","author":"Liman","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0167-6377(94)90069-8_BIB14","series-title":"Mathematical Programming: The State of the Art","first-page":"235","article-title":"Submodular functions and convexity","author":"Lovasz","year":"1983"},{"key":"10.1016\/0167-6377(94)90069-8_BIB15","article-title":"Scheduling problems with general earliness and tardiness cost structure; A Just-In-Time approach","author":"Mosheiov","year":"1990"},{"key":"10.1016\/0167-6377(94)90069-8_BIB16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/moor.3.3.177","article-title":"Best algorithms for approximating the maximum of a submodular set function","volume":"3","author":"Nemhauser","year":"1978","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(94)90069-8_BIB17","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions - I","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(94)90069-8_BIB18","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/0167-6377(94)90069-8_BIB19","series-title":"Linear and Integer Programming","author":"Schrijver","year":"1986"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900698?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900698?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:20:38Z","timestamp":1757452838000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637794900698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0167637794900698"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(94)90069-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-6377(94)90069-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1994 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}