{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T15:52:34Z","timestamp":1680450754978},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":[[1996,2]]},"DOI":"10.1016\/0305-0548(95)00008-a","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:08:45Z","timestamp":1027584525000},"page":"171-182","source":"Crossref","is-referenced-by-count":13,"title":["A branch and bound procedure to minimize mean absolute lateness on a single processor"],"prefix":"10.1016","volume":"23","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":"Kenneth","family":"Darby-Dowman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick R.","family":"Philipoom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)00008-A_BIB1","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(95)00008-A_BIB2","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(95)00008-A_BIB3","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/mnsc.18.9.518","article-title":"Variance minimization in single machine scheduling problems","volume":"18","author":"Merten","year":"1972","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00008-A_BIB4","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1287\/mnsc.21.5.540","article-title":"Minimizing the time-in-systems variance for a finite jobset","volume":"21","author":"Schrage","year":"1975","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00008-A_BIB5","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.23.6.567","article-title":"Minimizing waiting time variance in the single machine","volume":"23","author":"Eilon","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00008-A_BIB6","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(95)00008-A_BIB7","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":"Nav. Res. Logist."},{"key":"10.1016\/0305-0548(95)00008-A_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 machine scheduling problem","volume":"30","author":"Panwalker","year":"1982","journal-title":"Opns. Res."},{"key":"10.1016\/0305-0548(95)00008-A_BIB9","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":"Sundararghavan","year":"1984","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/0305-0548(95)00008-A_BIB10","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/mnsc.33.7.894","article-title":"Minimizing mean squared deviation of completed times about a common due date","volume":"33","author":"Bagchi","year":"1987","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00008-A_BIB11","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 completed times with different earliness and tardiness penalties and a common due date","volume":"34","author":"Bagchi","year":"1987","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/0305-0548(95)00008-A_BIB12","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)00008-A_BIB13","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","article-title":"One-processor scheduling with symmetric earliness and tardiness penalties","volume":"13","author":"Garey","year":"1988","journal-title":"Math. Opns. Res."},{"key":"10.1016\/0305-0548(95)00008-A_BIB14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1057\/jors.1988.26","article-title":"Dynamic programming state-space relaxation for single-machine scheduling","volume":"39","author":"Abdul-Razag","year":"1988","journal-title":"J. Opns. Res. Soc."},{"key":"10.1016\/0305-0548(95)00008-A_BIB15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.26.1.111","article-title":"Finding an optimal sequence by dynamic programming: an extension to precedence related tasks","volume":"26","author":"Baker","year":"1978","journal-title":"Opns. Res."},{"key":"10.1016\/0305-0548(95)00008-A_BIB16","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(95)00008-A_BIB17","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: a review","volume":"38","author":"Baker","year":"1990","journal-title":"Opns. Res."},{"key":"10.1016\/0305-0548(95)00008-A_BIB18","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(95)00008-A_BIB19","article-title":"Algorithm for a class of single-machine weighted tardiness and earliness problems","author":"Yano","year":"1989"},{"key":"10.1016\/0305-0548(95)00008-A_BIB20","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/opre.17.4.701","article-title":"One machine sequencing to minimize certain functions of job tardiness","volume":"17","author":"Emmons","year":"1969","journal-title":"Opns. Res."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489500008A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489500008A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:58:51Z","timestamp":1556657931000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489500008A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["030505489500008A"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)00008-a","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}