Simultaneous model building and validation with uniform designs of experiments

N

Semi-Dynamic Demand in a Non-Permutation Flowshop with Constrained Resequencing Buffers

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