Tabu search methods for a single machine scheduling problem

1991 ◽  
Vol 2 (2) ◽  
pp. 63-73 ◽  
Author(s):  
Manuel Laguna ◽  
J. Wesley Barnes ◽  
Fred W. Glover
Keyword(s):  
Tabu Search ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Search Methods ◽  
Tabu Search Methods

A Genetic Algorithm Enhanced by Tabu Search for the Single Machine Scheduling Problem with Deteriorating Jobs

2013 ◽  
Vol 774-776 ◽  
pp. 1842-1846
Author(s):  
Yue Yue Liu ◽  
Rui Zhang
Keyword(s):  
Tabu Search ◽  
Single Machine ◽  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Total Weighted Tardiness ◽  
Scheduling Problem ◽  
Genetic Operators ◽  
Optimal Sequence ◽  
Tabu Search Method

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.

Sign in / Sign up

Export Citation Format

Share Document