Single Machine Scheduling with Series-Parallel Precedence Constraints

From MaRDI portal

Revision as of 22:03, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3929382

Jump to:navigation, search

DOI10.1287/opre.29.6.1195zbMath0474.90048OpenAlexW2095315599MaRDI QIDQ3929382

George Steiner, R. N. Burns

Publication date: 1981

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.29.6.1195

zbMATH Keywords

single machine series-parallel graphs efficient algorithm acyclic digraph minimal total cost series-parallel precedence constraints task sequencing compact labeling scheme

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (5)

A compact labelling scheme for series-parallel graphs ⋮ \(P_ 4\)-trees and substitution decomposition ⋮ Modular decomposition and transitive orientation ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ An algorithm for minimizing setups in precedence constrained scheduling

This page was built for publication: Single Machine Scheduling with Series-Parallel Precedence Constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3929382&oldid=17607086"