Salhi, Said and Farber, Gerrit and Coves, Anna M. (2008) Semi-Dynamic Demand in a Non-Permutation Flowshop with Constrained Resequencing Buffers. In: Lirkov, I. and Margenov, S. and Wasniewski, Jerzy, eds. Large-Scale Scientific Computing 6th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 536-544. ISBN 978-3-540-78825-6. E-ISBN 978-3-540-78827-0. (doi:10.1007/978-3-540-78827-0_61) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:5231)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1007/978-3-540-78827-0_61 |
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.
Item Type: | Book section |
---|---|
DOI/Identification number: | 10.1007/978-3-540-78827-0_61 |
Uncontrolled keywords: | semi-dynamic demand; constraint logic programming; genetic algorithm; non-permutation flowshop; mixed model assembly line |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science |
Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
Depositing User: | Said Salhi |
Date Deposited: | 10 Mar 2009 18:40 UTC |
Last Modified: | 05 Nov 2024 09:37 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/5231 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):