A New Contribution for Solving Dynamic Scheduling Problems Using Genetic Algorithms

摘要

Scheduling is an important element of manufacturing systems because it allows to improve the system performance and serves as an overall plan on which system activities are based. The main purpose of this paper is to explore the use of evolutionary computation techniques for solving real world optimisation problems. These classes of problems have additional difficulties for the traditional optimisation techniques. This paper presents a simple and general framework based on Genetic Algorithms to solve dynamic Job-Shop scheduling problems. A new generation of initial individual and population is proposed. The proposed framework adapts the resolution of the deterministic problem to the non-deterministic one in which changes may occur continually. This takes into account dynamic occurrences in a manufacturing system and adapts the current population.