{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T06:42:46Z","timestamp":1778827366224,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0305-0548(99)00094-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:22:55Z","timestamp":1027606975000},"page":"127-137","source":"Crossref","is-referenced-by-count":41,"title":["Dynamic programming algorithms for scheduling parallel machines with family setup times"],"prefix":"10.1016","volume":"28","author":[{"given":"Scott","family":"Webster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meral","family":"Azizoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(99)00094-5_BIB1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0305-0548(90)90003-P","article-title":"Single facility multi-class job scheduling","volume":"17","author":"Ahn","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(99)00094-5_BIB2","first-page":"105","article-title":"Task sequencing in a batch environment with setup times","volume":"3","author":"Bruno","year":"1978","journal-title":"Foundations of Control Engineering"},{"key":"10.1016\/S0305-0548(99)00094-5_BIB3","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\/S0305-0548(99)00094-5_BIB4","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","article-title":"On the complexity of scheduling with batch setup times","volume":"37","author":"Monma","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(99)00094-5_BIB5","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"},{"key":"10.1016\/S0305-0548(99)00094-5_BIB6","unstructured":"Garey MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. San Francisco, CA: Freeman, 1979."},{"key":"10.1016\/S0305-0548(99)00094-5_BIB7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0167-6377(96)00054-5","article-title":"The complexity of scheduling job families about a common due date","volume":"20","author":"Webster","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(99)00094-5_BIB8","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"Communications of ACM"},{"key":"10.1016\/S0305-0548(99)00094-5_BIB9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6377(92)90035-2","article-title":"A new dynamic programming algorithm for the parallel machines total weighted completion time problem","volume":"11","author":"Lee","year":"1992","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(99)00094-5_BIB10","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","article-title":"Scheduling independent tasks on parallel processors","volume":"12","author":"Rothkopf","year":"1966","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(99)00094-5_BIB11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and scheduling problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Science"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000945?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000945?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T10:51:11Z","timestamp":1556448671000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054899000945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0305054899000945"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(99)00094-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}