A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints

DOI10.1287/mnsc.27.10.1209zbMath0465.90047OpenAlexW1978355645MaRDI QIDQ3917877

Howard J. 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

test problemsprecedence constraintsbranch and bound methodgreedy heuristicsingle machine sequencing

Mathematics Subject Classification ID

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

Related Items (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