A Decomposition Algorithm for Sequencing with General Precedence Constraints

DOI10.1287/MOOR.6.2.190MaRDI QIDQ3962769zbMATH OpenOpenAlexFDO

Authors Jeffrey B. Sidney

Publication date 1981

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.6.2.190

zbMATH Keywords

adjacent job interchange propertyadjacent sequence interchange propertyexistence of decomposition algorithmsgeneral precedence structuresleast cost fault detection problemmaximum cumulative cost problemseries-parallel precedence constraintssufficient condition for the existence of efficient algorithmstotal weighted exponential completion time problemtwo-machine maximum flow time problemunconstrained job sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of mathematical programming (90C90)

Cited in

(2)

• A decomposition theory based on a dominance relation and composite jobs
• THE TOTAL REPAIR COST IN A DEFECTIVE, COHERENT BINARY SYSTEM

This page was built for publication: A Decomposition Algorithm for Sequencing with General Precedence Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962769)