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

DOI10.1023/A:1011340311793zbMATH Open1013.90060OpenAlexW1538271496MaRDI QIDQ1850964FDOQ1850964

Authors: Peter Greistorfer, Hans Kellerer 

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

Recommendations

• scientific article; zbMATH DE number 1488082
• Tabu search algorithms for cyclic machine scheduling problems
• scientific article; zbMATH DE number 858990
• Determining the optimal starting times in a cyclic schedule with a given route
• Scheduling periodic events

zbMATH Keywords

heuristicsboundsschedulingtabu searchbottleneck problem

Mathematics Subject Classification ID

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

Cited In (5)

• Location of polygon vertices on circles and its application in transport studies
• On Graham's bound for cyclic scheduling
• Tabu search and iterated local search for the cyclic bottleneck assignment problem
• Tabu search algorithms for cyclic machine scheduling problems
• Title not available (Why is that?)

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

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