A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints

DOI10.1287/MNSC.27.10.1209MaRDI QIDQ3917877zbMATH OpenOpenAlexFDO

Authors H. Weiss

Publication date 1981

Published in Management Science (Search for Journal in Brave)

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

zbMATH Keywords

branch and bound methodgreedy heuristicprecedence constraintssingle machine sequencingtest problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Cited in

(2)

• A computational evaluation of optimal solution value estimation procedures
• Heuristic methods and applications: A categorized survey

This page was built for publication: A Greedy Heuristic 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 Q3917877)