An effective genetic algorithm for job shop scheduling
Authors:
- 1 April 2000
- journal article
- research article
- Published by SAGE Publications in Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture
- Vol. 214 (4) , 293-300
Abstract
This paper presents an effective genetic algorithm (GA) for job shop sequencing and scheduling. A simple and universal gene encoding scheme for both single machine and multiple machine models and their corresponding genetic operators, selection, sequence-extracting crossover and neighbour-swap mutation are described in detail. A simple heuristic rule is adapted and embedded into the GA to avoid the production of unfeasible solutions. The results of computing experiments for a number of scheduling problems have demonstrated that the GA described in the paper is effective and efficient in terms of the quality of solution and the computing cost.Keywords
This publication has 3 references indexed in Scilit:
- Solving job-shop scheduling problems by genetic algorithm2002
- Comparison of conventional and neural network heuristics for job shop scheduling1992
- A neural network approach to job-shop schedulingIEEE Transactions on Neural Networks, 1991