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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Da̧browski, P., Pempera, J., & Smutnicki, C. (2007). Minimizing cycle time of the flow line - Genetic approach with gene expression. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4431 LNCS, pp. 194–201). Springer Verlag. https://doi.org/10.1007/978-3-540-71618-1_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
