Have a personal or library account? Click to login
Genetic Algorithms for Solving Scheduling Problems in Manufacturing Systems Cover

Genetic Algorithms for Solving Scheduling Problems in Manufacturing Systems

Open Access
|Mar 2012

Abstract

Scheduling manufacturing operations is a complicated decision making process. From the computational point of view, the scheduling problem is one of the most notoriously intractable NP-hard optimization problems. When the manufacturing system is not too large, the traditional methods for solving scheduling problem proposed in the literature are able to obtain the optimal solution within reasonable time. But its implementation would not be easy with conventional information systems. Therefore, many researchers have proposed methods with genetic algorithms to support scheduling in the manufacturing system. The genetic algorithm belongs to the category of artificial intelligence. It is a very effective algorithm to search for optimal or near-optimal solutions for an optimization problem. This paper contains a survey of recent developments in building genetic algorithms for the advanced scheduling. In addition, the author proposes a new approach to the distributed scheduling in industrial clusters which uses a modified genetic algorithm.

DOI: https://doi.org/10.2478/v10238-012-0039-2 | Journal eISSN: 2300-5661 | Journal ISSN: 2080-7279
Language: English
Page range: 7 - 26
Published on: Mar 20, 2012
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2012 Anna Ławrynowicz, published by Warsaw University of Technology
This work is licensed under the Creative Commons License.

Volume 3 (2011): Issue 2 (December 2011)