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...

Full description

Saved in:
Bibliographic Details
Published inLarge-Scale Scientific Computing pp. 536 - 544
Main Authors Färber, Gerrit, Salhi, Said, Coves Moreno, Anna M.
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2008
SeriesLecture Notes in Computer Science
Subjects
Constraint Logic Programming
Genetic Algorithm
Mixed model assembly line
Non-Permutation Flowshop
Semi-dynamic demand
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783540788256
3540788255
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-78827-0_61