{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:19:00Z","timestamp":1769314740782,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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 & Operations Research"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0305-0548(02)00055-2","type":"journal-article","created":{"date-parts":[[2003,1,10]],"date-time":"2003-01-10T18:08:14Z","timestamp":1042222094000},"page":"801-808","source":"Crossref","is-referenced-by-count":55,"title":["Parallel machine earliness and tardiness scheduling with proportional weights"],"prefix":"10.1016","volume":"30","author":[{"given":"Hongyi","family":"Sun","sequence":"first","affiliation":[]},{"given":"Guoqing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00055-2_BIB1","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(02)00055-2_BIB2","first-page":"167","article-title":"Weighted tardiness single machine scheduling with proportional weights","volume":"57","author":"Szwarc","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB3","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":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB4","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":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB5","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1080\/07408179008964183","article-title":"Minimizing the weighted sum of late and early completion times in a single machine","volume":"22","author":"Ahmed","year":"1990","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0377-2217(91)90228-N","article-title":"Scheduling around a small common due date","volume":"55","author":"Hoogeveen","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB7","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1080\/07408179508936783","article-title":"Scheduling jobs with proportionate early\/tardy penalties","volume":"27","author":"Rachamadugu","year":"1995","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB8","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(95)00363-0","article-title":"A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: a case of small common due date","volume":"96","author":"Alidaee","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1111\/j.1937-5956.1994.tb00115.x","article-title":"Minimizing absolute and squared deviation of completion times from due dates","volume":"3","author":"Alidaee","year":"1994","journal-title":"Production and Operations Management"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/nav.3800310214","article-title":"Minimizing the sum of absolute lateness in single-machine and multimachine scheduling","volume":"31","author":"Sundararaghavan","year":"1984","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/nav.3800330105","article-title":"Single- and multiple-processor models for minimizing completion time variance","volume":"33","author":"Hall","year":"1986","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB12","first-page":"851","article-title":"Scheduling to a common due date on parallel common processors","volume":"34","author":"Emmons","year":"1987","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB13","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0167-6377(90)90056-B","article-title":"Equivalence of mean flow time problems and mean absolute deviation problems","volume":"9","author":"Kubiak","year":"1990","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB14","doi-asserted-by":"crossref","first-page":"1544","DOI":"10.1287\/mnsc.42.11.1544","article-title":"Heuristics for multi-machine scheduling problems with earliness and tardiness costs","volume":"42","author":"Federgruen","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB15","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0377-2217(98)00136-2","article-title":"A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem","volume":"116","author":"Chen","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB16","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1080\/002075498193192","article-title":"Minimizing the sum of job earliness and tardiness in a multimachine system","volume":"36","author":"Heady","year":"1998","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB17","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(02)00055-2_BIB18","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1137\/0204021","article-title":"Worst-case analysis of a placement algorithm related to storage allocation","volume":"4","author":"Chandra","year":"1975","journal-title":"SIAM Journal on Computing"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000552?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000552?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T20:52:50Z","timestamp":1554411170000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0305054802000552"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00055-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}