{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T12:53:35Z","timestamp":1680440015766},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3917,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s0166-218x(01)00334-1","type":"journal-article","created":{"date-parts":[[2002,8,26]],"date-time":"2002-08-26T19:45:48Z","timestamp":1030391148000},"page":"117-126","source":"Crossref","is-referenced-by-count":13,"title":["Finding the Pareto-optima for the total and maximum tardiness single machine problem"],"prefix":"10.1016","volume":"124","author":[{"given":"R","family":"Tadei","sequence":"first","affiliation":[]},{"given":"A","family":"Grosso","sequence":"additional","affiliation":[]},{"given":"F","family":"Della Croce","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00334-1_BIB1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0377-2217(93)90236-G","article-title":"Complexity of single machine, multi-criteria scheduling problems","volume":"70","author":"Chen","year":"1993","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00334-1_BIB2","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1057\/palgrave.jors.2600624","article-title":"A new decomposition approach for the single machine total tardiness scheduling problem","volume":"49","author":"Della Croce","year":"1998","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(01)00334-1_BIB3","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00334-1_BIB4","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":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00334-1_BIB5","unstructured":"A. Grosso, Single machine scheduling with tardiness penalties, Ph.D. Dissertation, Politecnico di Torino, DAI, 2001."},{"key":"10.1016\/S0166-218X(01)00334-1_BIB6","unstructured":"J.A. Hoogeven, Single machine bicriteria scheduling, Ph.D. Dissertation, CWI, Amsterdam, 1992."},{"key":"10.1016\/S0166-218X(01)00334-1_BIB7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Ann. Discrete Math."},{"issue":"6","key":"10.1016\/S0166-218X(01)00334-1_BIB8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0167-6377(82)90022-0","article-title":"A fully polynomial approximation scheme for the total tardiness problem","volume":"1","author":"Lawler","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(01)00334-1_BIB9","first-page":"42","article-title":"Various optimizers for single stage production","volume":"4","author":"Smith","year":"1956","journal-title":"Nav. Res. Logistics"},{"key":"10.1016\/S0166-218X(01)00334-1_BIB10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199903\/04)2:2<55::AID-JOS14>3.0.CO;2-5","article-title":"Solution of the single machine total tardiness problem","volume":"2","author":"Szwarc","year":"1999","journal-title":"J. Scheduling"},{"key":"10.1016\/S0166-218X(01)00334-1_BIB11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/jos.69","article-title":"Algorithmic paradoxes of the single machine total tardiness problem","volume":"4","author":"Szwarc","year":"2001","journal-title":"J. Scheduling"},{"key":"10.1016\/S0166-218X(01)00334-1_BIB12","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1080\/07408179508936738","article-title":"The single machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs","volume":"27","author":"Vairaktarakis","year":"1995","journal-title":"IIE Trans."},{"key":"10.1016\/S0166-218X(01)00334-1_BIB13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","article-title":"A bicriterion approach to time\/cost trade-offs in sequencing","volume":"11","author":"Van Wassenhove","year":"1982","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00334-1_BIB14","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1016\/0895-7177(89)90364-6","article-title":"Description and analysis of some representative interactive multicriteria procedures","volume":"12","author":"Vanderpooten","year":"1989","journal-title":"Math. Comput. Model."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003341?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003341?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:22:12Z","timestamp":1556864532000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01003341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0166218X01003341"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00334-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}