A Genetic Algorithm for Dynamic Job-Shop Scheduling

摘要

Scheduling is a combinatorial problem with important impact on both industrial and commerce. If it is performed well it obtains times and efficiency benefits and hence reduces costs. GA has been applied to solve several types of scheduling problems. However job-shop scheduling is the most common problem of interest. The job-shop scheduling problem involves placing jobs onto a set of machines with optimum objects, for instance, the aim of minimizing Makespan, the total time to complete all jobs. In this paper, a genetic algorithm has been proposed for dealing with general job-shop scheduling problems dynamically. It is easily implemented and performs quite ei'fectively.