A production scheduling problem using genetic algorithm

The way of flexible manufacturing cell work scheduling 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 optional mode — every operation can be done on every machine, and in second case cell works 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 schedule evaluation is the time of cell work. This time must be the shortest for definite number of jobs and machines.