{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T21:28:46Z","timestamp":1771882126545,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"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":[[2000,11]]},"DOI":"10.1016\/s0377-2217(99)00328-8","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"126-139","source":"Crossref","is-referenced-by-count":20,"title":["Minimizing maximum lateness with job families"],"prefix":"10.1016","volume":"127","author":[{"given":"Kenneth R.","family":"Baker","sequence":"first","affiliation":[]},{"given":"Michael J.","family":"Magazine","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00328-8_BIB1","unstructured":"Baker, K.R., 1997. Heuristic procedures for scheduling job families with setups and due dates. Naval Research Logistics (to appear)"},{"key":"10.1016\/S0377-2217(99)00328-8_BIB2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","article-title":"Complexity of task sequencing with deadlines, set-up times and changeover costs","volume":"7","author":"Bruno","year":"1978","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00328-8_BIB3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0167-6377(97)00028-X","article-title":"Batch scheduling to minimize maximum lateness","volume":"21","author":"Ghosh","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00328-8_BIB4","unstructured":"Hall, N.G., Posner, M.E., 1996. Generating experimental data for scheduling problems. Manuscript, Ohio State University, Columbus, OH"},{"key":"10.1016\/S0377-2217(99)00328-8_BIB5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1018903027868","article-title":"Single machine scheduling with batch set-up times to minimize maximum lateness","volume":"70","author":"Hariri","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00328-8_BIB6","unstructured":"Jackson, J.R., 1955. Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, UCLA"},{"key":"10.1016\/S0377-2217(99)00328-8_BIB7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/1520-6750(199106)38:3<333::AID-NAV3220380305>3.0.CO;2-0","article-title":"Minimizing flow time on a single machine with job classes and setup times","volume":"38","author":"Mason","year":"1991","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00328-8_BIB8","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","article-title":"On the complexity of scheduling with batch set-up times","volume":"37","author":"Monma","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00328-8_BIB9","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","article-title":"Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity","volume":"43","author":"Potts","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(99)00328-8_BIB10","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1287\/mnsc.42.8.1165","article-title":"Single-machine scheduling with reselase dates, due dates and family setup times","volume":"42","author":"Schutten","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00328-8_BIB11","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","article-title":"Scheduling groups of jobs on a single machine","volume":"43","author":"Webster","year":"1995","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003288?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003288?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T07:54:29Z","timestamp":1556438069000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799003288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0377221799003288"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00328-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}