Bounds and tabu search for a cyclic max-min scheduling problem

DOI10.1023/A:1011340311793zbMath1013.90060OpenAlexW1538271496MaRDI QIDQ1850964

Hans Kellerer, Peter Greistorfer

Publication date: 15 December 2002

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011340311793

zbMATH Keywords

heuristicsschedulingtabu searchboundsbottleneck problem

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: Bounds and tabu search for a cyclic max-min scheduling problem