Özet:

This paper presents a scheduling problem on parallel machines with sequence-dependent setup times and setup operations that performed by a single server. The main purpose is to get minimum makespan of the schedule. The system is formulated as genetic algorithm with problem sizes consisting of two machines and 10, 20 and 30 jobs. A genetic algorithm is developed using random data sets . The optimum results are obtained using a string based permutation algorithm which scans all alternatives. As a result, proposed algorithm is e ective to solve P2,SjSTsdjCmax scheduling problem on reasonable runtime and the results of the algorithm which are close to optimum solution values. E ectiveness of the solution is presented considering approximation rates of the genetic algorithm solutions to the optimum results obtained for P2,SjSTsdjCmax problem.

Anahtar Kelimeler: