Advertisement
Published in:
2009 | OriginalPaper | Chapter
Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem
Authors : Mitsuo Gen, Jie Gao, Lin Lin
Published in: Intelligent and Evolutionary Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Flexible job shop scheduling problem (fJSP) is an extension of the traditional job shop scheduling problem (JSP), which provides a closer approximation to real scheduling problems. In this paper, a multistage-based genetic algorithm with bottleneck shifting is developed for the fJSP problem. The genetic algorithm uses two vectors to represent each solution candidate of the fJSP problem. Phenotype-based crossover and mutation operators are proposed to adapt to the special chromosome structures and the characteristics of the problem. The bottleneck shifting works over two kinds of effective neighborhood, which use interchange of operation sequences and assignment of new machines for operations on the critical path. In order to strengthen the search ability, the neighborhood structure can be adjusted dynamically in the local search procedure. The performance of the proposed method is validated by numerical experiments on three representative problems.