Tabu search for a class of single-machine scheduling problems

Tabu search for a class of single-machine scheduling problems

0.00 Avg rating0 Votes
Article ID: iaor20021684
Country: United Kingdom
Volume: 28
Issue: 12
Start Page Number: 1223
End Page Number: 1230
Publication Date: Oct 2001
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics
Abstract:

In this paper we develop a tabu search-based solution procedure designed specifically for a certain class of single-machine scheduling problems with a non-regular performance measure. The performance of the developed algorithm is tested for solving the variance minimization problem. Problems from the literature are used to test the performance of the algorithm. This algorithm can be used for solving other problems such as minimizing completion time deviation from a common due date.

Reviews

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