A note on two-agent single-machine scheduling problem with deteriorating jobs

Author(s):  
Peng Liu ◽  
Daguang Feng ◽  
Xiaoye Zhou ◽  
Qi Tang
2013 ◽  
Vol 774-776 ◽  
pp. 1842-1846
Author(s):  
Yue Yue Liu ◽  
Rui Zhang

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.


2010 ◽  
Vol 34 (10) ◽  
pp. 3098-3107 ◽  
Author(s):  
Wen-Chiung Lee ◽  
Wei-Jhe Wang ◽  
Yau-Ren Shiau ◽  
Chin-Chia Wu

Sign in / Sign up

Export Citation Format

Share Document