Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers

Authors:
Gerrit Färber;Said Salhi;Anna M. Coves Moreno
Affiliations:
Institut d'Organització i Control de Sistemes Industrials, Universitat Politècnica de Catalunya, Barcelona, Spain;The Center for Heuristic Optimisation, Kent Business School, University of Kent, Canterbury, UK;Institut d'Organització i Control de Sistemes Industrials, Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
Large-Scale Scientific Computing
Year:
2009

Citing 7
Cited 0

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
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
Flowshop scheduling with limited temporary storage

Journal of the ACM (JACM)
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
Performance study of a genetic algorithm for sequencing in mixed model non-permutation flowshops using constrained buffers

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.