{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:51:57Z","timestamp":1772772717463,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"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":[[1997,8]]},"DOI":"10.1016\/s0305-0548(96)00080-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"775-788","source":"Crossref","is-referenced-by-count":57,"title":["Scheduling parallel machines to minimize total weighted and unweighted tardiness"],"prefix":"10.1016","volume":"24","author":[{"given":"Bahram","family":"Alidaee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duane","family":"Rosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00080-9_BIB1","first-page":"1","author":"Woolsey","year":"1975"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB2","first-page":"84","article-title":"Production scheduling quick and dirty methods for parallel machines","author":"Woolsey","year":"1990","journal-title":"Production Inventory Management Journal"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB3","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A \u2018pseudopolynomial\u2019 algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Annals Discrete Mathematics"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB4","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":"Annals Discrete Mathematics"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB5","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one processor is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Maths and Operations Research"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","article-title":"Branch and bound algorithm for the total weighted tardiness problem","volume":"33","author":"Potts","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB7","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":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0166-218X(90)90103-J","article-title":"A survey of algorithms for the single machine total weighted tardiness scheduling problem","volume":"26","author":"Abdul-Razaq","year":"1991","journal-title":"Discrete Applied Maths"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB9","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","article-title":"The total tardiness problem review and extensions","volume":"42","author":"Koulamas","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB10","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1287\/mnsc.11.3.460","article-title":"Scheduling with deadlines and loss functions on k parallel machines","volume":"11","author":"Root","year":"1965","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB11","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/mnsc.11.2.280","article-title":"On scheduling with deferral costs","volume":"11","author":"Lawler","year":"1964","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/05695557408974926","article-title":"Scheduling jobs on a number of identical machines","volume":"6","author":"Elmaghraby","year":"1974","journal-title":"AIIE Translation"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB13","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/opre.39.1.64","article-title":"Weighted-tardiness scheduling on parallel machines with proportional weights","volume":"39","author":"Arkin","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB14","first-page":"133","article-title":"Minimizing absolute and squared deviation of completion times from due dates","volume":"3","author":"Alidaee","year":"1994","journal-title":"J. POM"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB15","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/1520-6750(199106)38:3<367::AID-NAV3220380307>3.0.CO;2-I","article-title":"Heuristic for minimizing mean tardiness for m parallel machines","volume":"38","author":"Ho","year":"1991","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0305-0548(94)90094-9","article-title":"A greedy heuristic for the mean tardiness sequencing problem","volume":"21","author":"Fadalla","year":"1994","journal-title":"Computers Operations Research"},{"key":"10.1016\/S0305-0548(96)00080-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 Translation"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0272-6963(82)90020-1","article-title":"A dynamic priority rule for sequencing against due-dates","volume":"3","author":"Baker","year":"1982","journal-title":"Journal of Operational Management"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0360-8352(92)90033-G","article-title":"A note on the equivalence of the Wilkerson-Irwin and modified due-date rules for the mean tardiness sequencing problem","volume":"22","author":"Cheng","year":"1993","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB20","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/S0377-2217(95)00255-3","article-title":"A note on two rules on single machine tardiness problem","volume":"96","author":"Alidaee","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB21","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/0377-2217(93)90241-E","article-title":"A heuristic for the single machine tardiness problem","volume":"70","author":"Panwalkar","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB22","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.35.3.450","article-title":"A note on the weighted tardiness problem","volume":"35","author":"Rachamadugu","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB23","first-page":"215","article-title":"Heuristic for the common due date weighted tardiness problem","volume":"22","author":"Fathi","year":"1990","journal-title":"AIIE Translation"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB24","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/mnsc.11.2.268","article-title":"Bounds for the optimal scheduling of n jobs on m processors","volume":"11","author":"Eastman","year":"1964","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB25","series-title":"Heuristic Scheduling Systems","author":"Morton","year":"1994"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB26","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0360-8352(95)00166-2","article-title":"A computational experiment of COVERT_AU class of rules for single machine tardiness","volume":"30","author":"Alidaee","year":"1996","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB27","article-title":"Heuristic sequencing of jobs with single and multiple components","author":"Carroll","year":"1965"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB28","series-title":"GSIA Working Paper No. 36\u201383\u201384","article-title":"Accurate mayopic heuristics for tardiness scheduling","author":"Morton","year":"1984"},{"key":"10.1016\/S0305-0548(96)00080-9_BIB29","first-page":"20","article-title":"Sequencing with time delay costs","volume":"5","author":"Montagne","year":"1969","journal-title":"Arizona State University Industrial Engineering Research Bulletin"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000809?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000809?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T02:28:38Z","timestamp":1555986518000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":29,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0305054896000809"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00080-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}