Salhi, S. and Farber, G. and Coves, A.M. (2008) Semi Dynamic Demand in a Non-Permutation Flowshop with Constrained Resequencing Buffers. In: Lirkov, I. and Margenov, S. and Wasniewski, J., eds. Large-scale Scientific Computing. Lecture Notes in Computer Science. Lecture Notes in Computer Science, 4818 (8). Springer-Verlag, Berlin, pp. 536-544. ISBN 9783540788256.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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|
|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:||Faculties > Social Sciences > Kent Business School > Management Science|
|Depositing User:||Said Salhi|
|Date Deposited:||10 Mar 2009 18:40|
|Last Modified:||12 Oct 2010 15:44|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/5231 (The current URI for this page, for reference purposes)|
- Depositors only (login required):