A modified genetic algorithm approach to flexible job shop scheduling problem

Flexible job shop scheduling problem actually is extension of classical job shop problem. In this problem two constraints should be regarded simultaneously. The first is operation sequence and the second is machine vacation to process the assigned operation. In this paper we propose a novel genetic approach to solve this N-P hard problem. Also a set of numerical examples are presented to illustrate the proposed methods efficiency. Experimental results verify the solution method from computational time and quality of solution aspects as well.