A constructive genetic algorithm for permutation flowshop scheduling
| Area d'investigacio: | Articulos | Any: | 2008 | ||||
|---|---|---|---|---|---|---|---|
| Tipus de publicacio: | Articul | ||||||
| Autors: | Nagano, M. S.; Ruiz, Rubén; Lorena, L. A. N. | ||||||
| Revista: | Computers & Industrial Engineering | ||||||
| Número: | 55 | Pagines: | 195-207 | ||||
| Nota: | Times Cited: 0
Article
English
Nagano, M. S
Univ Sao Paulo, Dept Ind Engn, Sch Engn Sao Carlos, Av Trabalhador Saocarlense,400 Ctr, BR-13566590 Sao Paulo, Brazil
Cited References Count: 41
324RMPERGAMON-ELSEVIER SCIENCE LTDTHE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND
OXFORD |
||||||
| Abstract: | The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on m machines. In permutation flowshops the sequence of jobs is the same on all machines. A significant research effort has been devoted for sequencing jobs in a flowshop minimizing the makespan. This paper describes the application of a Constructive Genetic Algorithm (CGA) to makespan minimization on flowshop scheduling. The CGA was proposed recently as an alternative to traditional GA approaches, particularly, for evaluating schemata directly. The population initially formed only by schemata, evolves controlled by recombination to a population of well-adapted structures (schemata instantiation). The CGA implemented is based on the NEH classic heuristic and a local search heuristic used to define the fitness functions. The parameters of the CGA are calibrated using a Design of Experiments (DOE) approach. The computational results are compared against some other successful algorithms from the literature on Taillard\'s well-known standard benchmark. The computational experience shows that this innovative CGA approach provides competitive results for flowshop scheduling problems. |
||||||
| Versio digital | |||||||