Algoristics for Single-Machine Sequencing with Precedence Constraints

DOI10.1287/MNSC.24.10.1011MaRDI QIDQ4173171zbMATH OpenOpenAlexFDO

Authors Thomas E. Morton, Bala Ganga Dharan

Publication date 1978

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.24.10.1011

zbMATH Keywords

AlgoristicsSchedulingSingle-Machine Sequencing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Applications of mathematical programming (90C90)

Cited in

(5)

• A computational evaluation of optimal solution value estimation procedures
• On the evaluation of strategies for branching bandit processes
• Stochastic scheduling and forwards induction
• Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines
• A branch and bound algorithm for the minimum storage-time sequencing problem

This page was built for publication: Algoristics for Single-Machine Sequencing with Precedence Constraints

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