Complexity International       /vol11/zhang01/ © Copyright 2005     
Volume 11 Received: 
Accepted: 		 November 2004
December 2004


Multistage-based genetic algorithm for flexible job-shop scheduling problem

Haipeng Zhang, and Mitsuo Gen
Abstract
     Flexible Job-shop Scheduling Problem is expanded from the traditional Job-shop Scheduling Problem, which possesses wider availability of machines for all the operations. Considering the two states of the problem, two definitions (total and partial) of flexibility are offered to separate the different availability information of machines.

In this paper, a new multistage operation-based representation is proposed to make the chromosome simpler. By using this approach, all the crossover and mutation methods can be applied to this optimal strategy. The efficiency has been improved after using the new representation, and also the objective values outperform others.



Full Text

Multimedia Links
(none)

Reference Links
(none)

Citation Reference
Haipeng Zhang, and Mitsuo Gen 2005, Multistage-based genetic algorithm for flexible job-shop scheduling problem, Complexity International, Volume 11, Paper ID: zhang01, URL: http://www.complexity.org.au/vol11/zhang01/
      Get viewers
for PS & PDF