This work presents the performance comparison of two conceptually different approaches for a mixed model non-permutation flowshop production line. The demand is a semi-dynamic demand with a fixed job sequence for the first station. Resequencing is permitted where stations have access to intermediate 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. An exact approach, using Constraint Logic Programming (CLP), and a heuristic approach, a Genetic Algorithm (GA), were applied. © 2008 Springer.
CITATION STYLE
Färber, G., Salhi, S., & Coves Moreno, A. M. (2008). Semi-dynamic demand in a non-permutation flowshop with constrained resequencing buffers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4818 LNCS, pp. 536–544). https://doi.org/10.1007/978-3-540-78827-0_61
Mendeley helps you to discover research relevant for your work.