Meta-heuristics to solve single-machine scheduling problem with sequence-dependent setup time and deteriorating jobs
Source: The International Journal of Advanced Manufacturing Technology, Volume 50, Numbers 5-8, September 2010 , pp. 749-759(11)
Abstract:This paper tackles the single-machine scheduling problem in which there are sequence-dependent setup times and deteriorating jobs. In this regard, a mathematical model has been formulated to minimize makespan (C max). Afterwards, genetic and tabu search algorithms have been developed. Since the population diversity is a very important issue in preventing neighborhood search from trapping in a local optimum, some methods have been applied to genetic algorithm in order to maintain population diversity, and the final results show the effectiveness of these methods. The calibration of genetic algorithm parameters and operators is performed using design of experiments. Finally, several examples are produced to illustrate the proposed approach.
Document Type: Research Article
Affiliations: 1: Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran 2: Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran, Email: Majid_yolmeh@yahoo.com
Publication date: 2010-09-01