{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:18:27Z","timestamp":1769811507253,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1016\/s0377-2217(98)00111-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:48:22Z","timestamp":1027619302000},"page":"403-410","source":"Crossref","is-referenced-by-count":12,"title":["Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness"],"prefix":"10.1016","volume":"114","author":[{"given":"T.C.Edwin","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail Y","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00111-8_BIB1","unstructured":"H.G. Kahlbacher, Due date assignment methods and single machine scheduling, Presentation at the Third International Workshop on Project Management and Scheduling in Como, 1992"},{"key":"10.1016\/S0377-2217(98)00111-8_BIB2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02192303","article-title":"Processing plus wait due dates in single machine scheduling","volume":"85","author":"Kahlbacher","year":"1995","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0377-2217(98)00111-8_BIB3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/1520-6750(199402)41:1<33::AID-NAV3220410104>3.0.CO;2-S","article-title":"The parallel machine min\u2013max weighted absolute lateness scheduling problem","volume":"41","author":"Li","year":"1994","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(98)00111-8_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0360-8352(83)90029-3","article-title":"Due-date selection procedures for job-shop simulation","volume":"7","author":"Smith","year":"1983","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(98)00111-8_BIB5","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","article-title":"Survey of scheduling research involving due-date determination decisions","volume":"38","author":"Cheng","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00111-8_BIB6","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\/S0377-2217(98)00111-8_BIB7","doi-asserted-by":"crossref","unstructured":"S.C. Wheelwright, Reflecting corporate strategy in manufacturing decisions, Business Horizons (1978) 57\u201366","DOI":"10.1016\/0007-6813(78)90032-0"},{"key":"10.1016\/S0377-2217(98)00111-8_BIB8","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1080\/00207548408942488","article-title":"A framework for the study of due-date management in job-shops","volume":"22","author":"Ragatz","year":"1984","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(98)00111-8_BIB9","unstructured":"K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974"},{"key":"10.1016\/S0377-2217(98)00111-8_BIB10","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\/S0377-2217(98)00111-8_BIB11","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798001118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798001118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:59:42Z","timestamp":1556110782000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798001118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0377221798001118"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00111-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}