A simulated annealing and tabu search mixture algorithm for the scheduling tardiness problem

A simulated annealing and tabu search mixture algorithm for the scheduling tardiness problem

0.00 Avg rating0 Votes
Article ID: iaor19982207
Country: Netherlands
Volume: 88
Issue: 3
Start Page Number: 516
End Page Number: 524
Publication Date: Feb 1996
Journal: European Journal of Operational Research
Authors:
Keywords: optimization: simulated annealing
Abstract:

In the daily activity of workshops the problem of minimizing delay in dispatching is one of the most interesting among those of scheduling. Throughout this article a mixed application of simulated annealing (which allows tabu search to be started from a better initial solution) and tabu search is studied.

Reviews

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