{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:45:42Z","timestamp":1768344342174,"version":"3.49.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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":[[2003,10]]},"DOI":"10.1016\/s0305-0548(02)00105-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"1777-1789","source":"Crossref","is-referenced-by-count":100,"title":["Scheduling unrelated parallel machines to minimize total weighted tardiness"],"prefix":"10.1016","volume":"30","author":[{"given":"Ching-Fang","family":"Liaw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang-Kuei","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Yuan","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingchin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00105-3_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB2","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 of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB3","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB4","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/opre.21.3.846","article-title":"Minimizing average flow time with parallel machines","volume":"21","author":"Horn","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1080\/07408179908969814","article-title":"Scheduling jobs on unrelated parallel machines to minimize regular total cost functions","volume":"31","author":"Azizoglu","year":"1999","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB6","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/S0305-0548(96)00080-9","article-title":"Scheduling parallel machines to minimize total weighted and unweighted tardiness","volume":"24","author":"Alidaee","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/(SICI)1520-6750(199702)44:1<109::AID-NAV7>3.0.CO;2-E","article-title":"Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem","volume":"44","author":"Koulamas","year":"1997","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0925-5273(98)00034-6","article-title":"Tardiness minimization on parallel machines","volume":"55","author":"Azizoglu","year":"1998","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"1","author":"Kuhn","year":"1955","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB10","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1287\/opre.22.1.46","article-title":"Coordinating aggregate and detailed scheduling decisions in the one-machine job shop","volume":"22","author":"Gelders","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB11","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":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB12","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.35.3.450","article-title":"A note on weighted tardiness problem","volume":"35","author":"Rachamadugu","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB13","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1080\/095372899233299","article-title":"A new dominance rule for the total weighted tardiness problem","volume":"10","author":"Akturk","year":"1999","journal-title":"Production Planning and Control"},{"key":"10.1016\/S0305-0548(02)00105-3_BIB14","unstructured":"Morton TE, Rachamadugu RM, Vepsalainen A. Accurate myopic heuristics for tardiness scheduling, GSIA Working Paper No. 36-83-84, Carnegie-Mellon University, PA, 1984."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:25:08Z","timestamp":1553930708000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":14,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0305054802001053"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00105-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}