| 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 method can be applied to this optimal strategy. The efficiency has been improved after using the new representation, and also the objective values outperform others. |