Performance study of a genetic algorithm for sequencing in mixed model non-permutation flowshops using constrained buffers

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents the performance study of a Genetic Algorithm applied to a mixed model non-permutation flowshop production line. Resequencing is permitted where stations have access to intermittent or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products, Characteristics such as the difference between the intermittent and the centralized case, the number of buffer places and the distribution of the buffer places are analyzed. Improvements that come with the introduction of constrained resequencing buffers are highlighted. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Färber, G., & Coves Moreno, A. M. (2006). Performance study of a genetic algorithm for sequencing in mixed model non-permutation flowshops using constrained buffers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3982 LNCS, pp. 638–648). Springer Verlag. https://doi.org/10.1007/11751595_68

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free