Using a Hybrid Genetic Algorithm to Minimize the Number of Tardy Jobs in the Flow Shop

Abstract:

Article Preview

Numerous real-world problems relating to flow shops scheduling are complex. The main problem is that the solution space is very large and therefore the set of feasible solutions cannot be enumerated one by one. Current approaches to solve these problems are metaheuristics techniques, which fall in two categories: population-based search and trajectory-based search. Because of their complexity, recent research has turned to genetic algorithms to address such problems. In this paper we present an effective hybrid approach based on genetic algorithm (GA) for minimizing the number of tardy jobs in a flow shop consisting of m machines. Jobs with processing times and due dates randomly arrive to the system. We assume that job arrival or release dates are not known in advance. The objective is to minimize the number of tardy jobs. Although genetic algorithms have been proven to facilitate the entire space search, they lack in fine-tuning capability for obtaining the global optimum. Therefore the proposed approach incorporates a fitness functions and a population trained by a local improvement search based on tabu search with a candidate list strategy into GA for the problem which belongs to NP-hard class. Experimentation results show that the number of cells and the crossover strategy adapted affect the number of tardy jobs found. The results also indicate that hybrid genetic algorithm approach improves the solution quality drastically.

Info:

Periodical:

Advanced Materials Research (Volumes 201-203)

Edited by:

Daoguo Yang, Tianlong Gu, Huaiying Zhou, Jianmin Zeng and Zhengyi Jiang

Pages:

1070-1074

DOI:

10.4028/www.scientific.net/AMR.201-203.1070

Citation:

J. J. Wu "Using a Hybrid Genetic Algorithm to Minimize the Number of Tardy Jobs in the Flow Shop", Advanced Materials Research, Vols. 201-203, pp. 1070-1074, 2011

Online since:

February 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.