{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:31:49Z","timestamp":1759667509741},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0305-0548(90)90033-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"105-112","source":"Crossref","is-referenced-by-count":19,"title":["Single machine scheduling to minimize mean absolute lateness: A heuristic solution"],"prefix":"10.1016","volume":"17","author":[{"given":"Timothy D.","family":"Fry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald D.","family":"Armstrong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Drew Rosen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(90)90033-4_BIB1","series-title":"Theory of Sequencing","author":"Conway","year":"1967"},{"key":"10.1016\/0305-0548(90)90033-4_BIB2","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. Log. Q."},{"issue":"1","key":"10.1016\/0305-0548(90)90033-4_BIB3","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"},{"key":"10.1016\/0305-0548(90)90033-4_BIB4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/opre.25.1.62","article-title":"Optimal single machine scheduling with earliness and tardiness penalties","volume":"25","author":"Sidney","year":"1977","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90033-4_BIB5","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1287\/opre.26.6.1079","article-title":"Optimal single-machine scheduling with earliness and tardiness penalties","volume":"26","author":"Lakshiminarayan","year":"1978","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90033-4_BIB6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/nav.3800310214","article-title":"Minimizing the sum of absolute lateness in single-machine and multi-machine scheduling","volume":"31","author":"Sundararaghavan","year":"1984","journal-title":"Naval Res. Log. Q."},{"key":"10.1016\/0305-0548(90)90033-4_BIB7","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/mnsc.33.7.894","article-title":"Minimizing mean squared deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1987","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90033-4_BIB8","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","article-title":"Common due date assignment to minimize total penalty for the one machinescheduling problem","volume":"30","author":"Panwalker","year":"1982","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90033-4_BIB9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0167-188X(83)90012-5","article-title":"Minimizing a quadratic function of job lateness on a single machine","volume":"7","author":"Gupta","year":"1983","journal-title":"Engng Costs Product. Econ."},{"key":"10.1016\/0305-0548(90)90033-4_BIB10","article-title":"Minimizing mean absolute deviation of completion times about a common due date","author":"Bagchi","year":"1989","journal-title":"Naval Res. Log. Q."},{"key":"10.1016\/0305-0548(90)90033-4_BIB11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/07408178708975418","article-title":"Minimizing weighted absolute deviation in single machine scheduling","volume":"19","author":"Fry","year":"1987","journal-title":"IIE Trans."},{"key":"10.1016\/0305-0548(90)90033-4_BIB12","article-title":"A branch and bound procedure to minimize mean absolute deviation","author":"Fry","year":"1987"},{"key":"10.1016\/0305-0548(90)90033-4_BIB13","series-title":"Scheduling to minimize weighted absolute deviation","author":"Fry","year":"1984"},{"key":"10.1016\/0305-0548(90)90033-4_BIB14","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/321574.321584","article-title":"An approach to solving linear discrete optimization problems","volume":"17","author":"Roth","year":"1970","journal-title":"J. Ass. Comput. Machin."},{"key":"10.1016\/0305-0548(90)90033-4_BIB15","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":"Rinnooy Kan","year":"1975","journal-title":"Opns Res."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054890900334?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054890900334?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:59:20Z","timestamp":1552928360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054890900334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0305054890900334"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(90)90033-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}