Dynamic job shop scheduling with alternative routes based on genetic algorithm

Abdalla Ali, Philip Hackney, David Bell, Martin Birkett

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this paper, we propose Genetic Algorithms (GAs) for the Dynamic Job-Shop Scheduling Problem (DJSP) with alternative routes, which is an extension case of the classical job-shop scheduling problem. Although the alternative machines add more complexity to the problem, it simulates real world job shop production scheduling requirements more effectively. GAs have been widely used for scheduling problems but the quality of the solution mainly depends on the design of the solution procedure. Therefore, different strategies are presented and applied to form the initial population. A single individual crossover operator is applied to produce a new chromosome and a mutation operator is presented to generate alternative routes as well as to maintain the diversity of the population. The model was validated by using different instances taken from the literature. The result obtained from the computational study has shown that the proposed approach is a feasible and effective solution to the DJSP.
Original languageEnglish
Title of host publicationEngineering Optimization
EditorsAurelio Araujo
Place of PublicationBoca Raton, FL
PublisherTaylor & Francis
Pages827-832
Number of pages1078
VolumeIV
ISBN (Print)978-1-138-02725-1
Publication statusPublished - 26 Sep 2014

Fingerprint Dive into the research topics of 'Dynamic job shop scheduling with alternative routes based on genetic algorithm'. Together they form a unique fingerprint.

Cite this