p.1823
p.1827
p.1833
p.1838
p.1842
p.1847
p.1853
p.1859
p.1865
A Genetic Algorithm Enhanced by Tabu Search for the Single Machine Scheduling Problem with Deteriorating Jobs
Abstract:
This paper considers a single machine scheduling problem with deterioration and no inserted idle times. Each job has a due date, a weight and a processing time. The objective is to find an optimal sequence of the set of jobs to minimize the total weighted tardiness. To prevent premature convergence of the optimization algorithm, a genetic tabu search (GTS) algorithm is presented. In the GTS, the mutation operator is implemented with the tabu search method to enhance the local search ability. A fair comparison of genetic operators has been made between GTS and simple GA, and the experimental results show that the GTS considerably outperforms the simple GA.
Info:
Periodical:
Pages:
1842-1846
Citation:
Online since:
September 2013
Authors:
Price:
Сopyright:
© 2013 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: