Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Sequencing methods for automated storage and retrieval systems with dedicated storage
Computers and Industrial Engineering
Flow-shop scheduling for three serial stations with the last two duplicate
Computers and Operations Research
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
Computers and Operations Research
Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers
Large-Scale Scientific Computing
| Hi-index | 0.00 |
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.