{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:26:14Z","timestamp":1787340374530,"version":"3.56.0"},"reference-count":10,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1978,11]]},"abstract":"<jats:p>In this paper we consider the problem of sequencing classes of tasks with deadlines in which there is a set-up time or a changeover cost associated with switching from tasks in one class to another. We consider the case of a single machine and our results delineate the borderline between polynomial-solvable and $NP$-complete versions of the problem. This is accomplished by giving polynomial time reductions, pseudo-polynomial time algorithms and polynomial time algorithms for various restricted cases of these problems.<\/jats:p>","DOI":"10.1137\/0207031","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:01:52Z","timestamp":1109224912000},"page":"393-404","source":"Crossref","is-referenced-by-count":120,"title":["Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs"],"prefix":"10.1137","volume":"7","author":[{"given":"John","family":"Bruno","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Downey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","volume-title":"The design and analysis of computer algorithms","author":"Aho Alfred V.","year":"1975"},{"key":"R2","volume-title":"Computer and job-shop scheduling theory","author":"Bruno J. L.","year":"1976"},{"key":"R3","volume":"23","author":"Driscoll W. C.","year":"1975","journal-title":"Bull. ORSA"},{"key":"R4","volume-title":"A branch-bound algorithm for scheduling production on one machine with changeover costs","author":"Driscoll W. C.","year":"1976"},{"key":"R5","unstructured":"W. C. Driscoll, Emmons H.,  Scheduling production on one machine with changeover costs, Traps. Amer. Inst. Industrial Engineers, to appear"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322090"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.2.342"},{"key":"R9","volume-title":"Combinatorial optimization: networks and matroids","author":"Lawler Eugene L.","year":"1976"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1972.4309158"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0207031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:32:10Z","timestamp":1787337130000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0207031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,11]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1978,11]]}},"alternative-id":["10.1137\/0207031"],"URL":"https:\/\/doi.org\/10.1137\/0207031","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,11]]}}}