Benchmarch results of a genetic algorithm for non-permutation flowshops using constrained buffers
Document typeConference report
Rights accessOpen Access
This paper presents the performance study of a Genetic Algorithm, for the special case of a mixed model non-permutation flowshop production line, where resequencing is permitted when 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. Results from other authors are compared which presented results on permutation sequences  or which treat a problem similar to the one studied in this work , based on the benchmark data provided by Taillard . Improvements that come with the introduction of constrained resequencing buffers are highlighted.