{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:29:34Z","timestamp":1787340574362,"version":"build-2736575974"},"reference-count":17,"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":[[1985,11]]},"abstract":"<jats:p>Construction of classes of ordered sets are given for which the setup minimization problem can be solved by an efficient algorithm. Those constructions generalize series-parallel connections. Special classes of ordered sets are exhibited for which the greedy algorithm yields an optimal linear extension. In particular, it is shown that the class of N-free ordered sets is both defect optimal and strongly greedy.<\/jats:p>","DOI":"10.1137\/0214068","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"954-965","source":"Crossref","is-referenced-by-count":12,"title":["Algorithmic Approaches to Setup Minimization"],"prefix":"10.1137","volume":"14","author":[{"given":"Ulrich","family":"Faigle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard","family":"Gierz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rainer","family":"Schrader","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","volume-title":"Lattice theory","author":"Birkhoff Garrett","year":"1967"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.2.170"},{"key":"R3","first-page":"183","volume":"16","author":"Chaty G.","year":"1979","journal-title":"Utilitas Math."},{"key":"R4","doi-asserted-by":"crossref","DOI":"10.1051\/ita\/1979130100031","volume":"13","author":"Cogis O.","year":"1979","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.2307\/1969503"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1982-0660592-3"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45567-4_23"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0604016"},{"key":"R9","volume-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic Martin Charles","year":"1980"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.4064\/fm-65-2-157-167"},{"key":"R11","first-page":"743","volume":"33","author":"Heuchenne C.","year":"1964","journal-title":"Bull. Soc. Roy. Sci. Li\u00e8ge"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.4064\/fm-79-1-11-22"},{"key":"R13","unstructured":"W. R. Pulleyblank,  On minimizing setups in precedence constrained scheduling,  1981, preprint, Discr. Appl. Math., to appear"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1983-0715851-3"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.4064\/fm-16-1-386-389"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00396269"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/0211023"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:40:06Z","timestamp":1787337606000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["10.1137\/0214068"],"URL":"https:\/\/doi.org\/10.1137\/0214068","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}