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.