Tabu search for a class of single-machine scheduling problems

Citation
U. Al-turki et al., Tabu search for a class of single-machine scheduling problems, COMPUT OPER, 28(12), 2001, pp. 1223-1230
Citations number
21
Categorie Soggetti
Engineering Management /General
Journal title
COMPUTERS & OPERATIONS RESEARCH
ISSN journal
03050548 → ACNP
Volume
28
Issue
12
Year of publication
2001
Pages
1223 - 1230
Database
ISI
SICI code
0305-0548(200110)28:12<1223:TSFACO>2.0.ZU;2-R
Abstract
In this paper we develop a tabu search-based solution procedure designed sp ecifically for a certain class of single-machine scheduling problems with a non-regular performance measure. The performance of the developed algorith m is tested for solving the variance minimization problem. Problems from th e literature are used to test the performance of the algorithm. This algori thm can be used for solving other problems such as minimizing completion ti me deviation from a common due date.