A Genetic Algorithm for Production Scheduling Problem in Flexible Manufacturing Cell

Though the designs of FMC strive to ensure the maximum flexibility in the system, in practice, after the implementation of such systems the operational executives often find it hard to accommodate frequent variations in the part designs of incoming jobs. The difficulty can vary well be overcome by scheduling the variety of incoming problem into the system efficiently. The scheduling of FMS with the aid of Genetic Algorithm and draft of code strings, which are used by this algorithm have been presented in this paper. Moreover, some results obtained by computer program based on this method also have been presented. In first case it has been assumed that the cell works in optimal mode. Every operation can be done on every machine and in the second case cell assorts in sequential mode. The first operation is executed on the first machine, the second operation on the second machine and so on. The only criterion of scheduling evaluation is the time of cell work. The time must be the shortest for definite number of jobs and machines.