Paper
20 August 1999 Job-shop scheduling with a combination of evolutionary and heuristic methods
Bela Patkai, Seppo Torvinen
Author Affiliations +
Abstract
Since almost all of the scheduling problems are NP-hard-- cannot be solved in polynomial time--those companies that need a realistic scheduling system face serious limitations of available methods for finding an optimal schedule, especially if the given environment requires adaptation to dynamic variations. Exact methods do find an optimal schedule, but the size of the problem they can solve is very limited, excluding this way the required scalability. The solution presented in this paper is a simple, multi-pass heuristic method, which aims to avoid the limitations of other well-known formulations. Even though the dispatching rules are fast and provide near-optimal solutions in most cases, they are severely limited in efficiency--especially in case the schedule builder satisfies a significant number of constraints. That is the main motivation for adding a simplified genetic algorithm to the dispatching rules, which--due to its stochastic nature--belongs to heuristic, too. The scheduling problem is of a middle size Finnish factory, throughout the investigations their up-to-date manufacturing data has been used for the sake of realistic calculations.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bela Patkai and Seppo Torvinen "Job-shop scheduling with a combination of evolutionary and heuristic methods", Proc. SPIE 3833, Intelligent Systems in Design and Manufacturing II, (20 August 1999); https://doi.org/10.1117/12.359504
Lens.org Logo
CITATIONS
Cited by 6 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Genetic algorithms

Stochastic processes

Genetics

Evolutionary algorithms

Manufacturing

Systems modeling

Binary data

RELATED CONTENT

Genetic design and optimization of military antennas
Proceedings of SPIE (May 22 2006)
Large ratios of mutation to crossover the example of...
Proceedings of SPIE (September 01 1993)
Application of evolutionary computation in ECAD problems
Proceedings of SPIE (October 13 1998)
Distributed caching strategy
Proceedings of SPIE (April 15 2008)
Foundations of evolutionary computation
Proceedings of SPIE (May 20 2006)
Differential evolution based on hybrid crossover operators
Proceedings of SPIE (October 01 2011)

Back to Top