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

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

Mathematics Subject Classification ID

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

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)