Tabu search algorithms for cyclic machine scheduling problems

Tabu search algorithms for cyclic machine scheduling problems

0.00 Avg rating0 Votes
Article ID: iaor2008950
Country: United Kingdom
Volume: 8
Issue: 4
Start Page Number: 303
End Page Number: 322
Publication Date: Jul 2005
Journal: Journal of Scheduling
Authors: ,
Keywords: scheduling
Abstract:

Tabu search algorithms are developed for solving a large class of cyclic machine scheduling problems with the objective to minimize the cycle time. Neighborhoods are derived which generalize the block-approach based neighborhoods which have been successfully applied to noncyclic job-shop problems. For a variant of this neighborhood opt-connectivity is proved. The tabu-search procedure is applied to cyclic job-shop scheduling problems. Computational results are presented.

Reviews

Required fields are marked *. Your email address will not be published.