Minimizing Cycle Time of the Flow Line --- Genetic Approach with Gene Expression

Authors:
Paweł Dąbrowski;Jarosław Pempera;Czesław Smutnicki
Affiliations:
Wrocław University of Technology, Institute of Computer Engineering, Control and Robotics, Janiszewskiego 11-17, 50-372 Wrocław, Poland;Wrocław University of Technology, Institute of Computer Engineering, Control and Robotics, Janiszewskiego 11-17, 50-372 Wrocław, Poland;Wrocław University of Technology, Institute of Computer Engineering, Control and Robotics, Janiszewskiego 11-17, 50-372 Wrocław, Poland
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Year:
2007

Citing 5
Cited 0

Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Improved genetic algorithm for the permutation flowshop scheduling problem

Computers and Operations Research
Proximity and priority: applying a gene expression algorithm to the Traveling Salesperson Problem

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the flow-shop scheduling problem with no-store policy and minimal cycle time criterion. The model and some properties of the problem have been presented. To solve the problem, we propose new genetic algorithm equipped with auxiliary gene expression mechanism, which creates offspring using genetic information from both parents as well as asleep information from ancestors (grand- father, grand grandfather). The presented computational tests proved superiority of the proposed approach over traditional, basic GA scheme.