Monma, Clyde L.; Sidney, Jeffrey B. Sequencing with series-parallel precedence constraints. (English) Zbl 0437.90047 Math. Oper. Res. 4, 215-224 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 36 Documents MSC: 90B35 Deterministic scheduling theory in operations research 65K05 Numerical mathematical programming methods Keywords:sequencing; series-parallel precedence constraints; scheduling; adjacent pairwise job interchange; total preference ordering; subsequences of jobs; efficient general algorithm; least cost fault detection problem; one-machine total weighted completion time problem; two-machine maximum completion time flow-shop problem; maximum cumulative cost problem PDF BibTeX XML Cite \textit{C. L. Monma} and \textit{J. B. Sidney}, Math. Oper. Res. 4, 215--224 (1979; Zbl 0437.90047) Full Text: DOI