{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:27Z","timestamp":1747548327901},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1016\/0167-6377(92)90060-g","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"39-44","source":"Crossref","is-referenced-by-count":3,"title":["A new lower bound approach for single-machine multicriteria scheduling"],"prefix":"10.1016","volume":"11","author":[{"given":"J.A","family":"Hoogeveen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.L","family":"van de Velde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90060-G_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: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0167-6377(92)90060-G_BIB2","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1057\/jors.1984.168","article-title":"Minimizing the range of lateness on a single machine","volume":"35","author":"Gupta","year":"1984","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0167-6377(92)90060-G_BIB3","article-title":"Minimizing maximum earliness and maximum lateness on a single machine","author":"Hoogeveen","year":"1990"},{"key":"10.1016\/0167-6377(92)90060-G_BIB4","article-title":"Polynomial-time algorithms for multicriteria scheduling problems","author":"Hoogeveen","year":"1990"},{"key":"10.1016\/0167-6377(92)90060-G_BIB5","article-title":"Scheduling a production line to minimize maximum tardiness","author":"Jackson","year":"1955"},{"key":"10.1016\/0167-6377(92)90060-G_BIB6","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/mnsc.32.4.464","article-title":"Scheduling with multiple performance measures: The one-machine case","volume":"32","author":"Nelson","year":"1986","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(92)90060-G_BIB7","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1080\/05695558308974617","article-title":"A branch-and-bound procedure to solve a bricriterion scheduling problem","volume":"15","author":"Sen","year":"1983","journal-title":"IEE Trans."},{"key":"10.1016\/0167-6377(92)90060-G_BIB8","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/mnsc.34.2.254","article-title":"A branch-and-bound approach to the bicriterion scheduling problem involving total flowtime and range of lateness","volume":"34","author":"Sen","year":"1988","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(92)90060-G_BIB9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0305-0548(83)90018-7","article-title":"Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number tardy","volume":"10","author":"Shanthikumar","year":"1983","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0167-6377(92)90060-G_BIB10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"1","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0167-6377(92)90060-G_BIB11","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1057\/jors.1988.114","article-title":"Improved bounds for the range of lateness on a single machine","volume":"39","author":"Tegze","year":"1988","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0167-6377(92)90060-G_BIB12","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1287\/mnsc.24.5.530","article-title":"The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution","volume":"24","author":"Townsend","year":"1978","journal-title":"Management Sci."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290060G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290060G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:27:48Z","timestamp":1552886868000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290060G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["016763779290060G"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90060-g","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}