Using Genetic Algorithm to Solve Sequence Dependent Setup Time Jobs Scheduling Problem

Abstract

Scheduling problems exist in many applications and most of them have demonstrated as NP complete. A lot of schemes introduced to solve scheduling problem. Among them, genetic algorithm (GA) is successfully used for similar problems in the past, and leading toward much more successful on some NP-complete domain than others. In this paper, we presented a genetic algorithm to solve “sequence dependent setup time” jobs scheduling problem. The objective of this paper is to minimized the make span and (or) maximum machine utilization. Simulation results demonstrate that the proposed method can find a good solution and is subjected to user requirements, if the user has different objective considerations.