Farber, G. and Salhi, S. and Coves, A.M. (2010) Performance evaluation of hybrid-CLP vs GA: Non permutation flowshop with constrained resequencing buffers. International Journal of Manufacturing & Management, 20 (1/4). pp. 242-258. ISSN 1368-2148.
This is the latest version of this item.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
This paper is located in the area of mixed model non-permutation flowshop production lines where jobs of more than one model are being processed on the same production line in an arbitrary sequence. Nevertheless, the majority of publications in this area are limited to solutions which determine the job sequence before the jobs enters the line and maintains it without interchanging jobs until the end of the production line, which is known as permutation flowshop. The present work considers a non-permutation flowshop. Resequencing is permitted where stations have access to intermediate or centralised resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. The primary objective is the minimisation of the make span, but also setup-cost and setup-time is contemplated. A hybrid approach, using constraint logic programming (CLP), is presented and compared to a genetic algorithm (GA). These solution methods are conceptually different and recommendations for their applicability are presented.
|Subjects:||Q Science > Operations Research - Theory|
|Divisions:||Faculties > Social Sciences > Kent Business School > Management Science|
|Depositing User:||Said Salhi|
|Date Deposited:||26 Oct 2010 15:24|
|Last Modified:||25 Nov 2011 16:16|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/25938 (The current URI for this page, for reference purposes)|
Available versions of this item
Performance evaluation of hybrid-CLP vs GA: Non permutation flowshop with constrained resequencing buffers. (deposited 30 Sep 2010 11:14)
- Performance evaluation of hybrid-CLP vs GA: Non permutation flowshop with constrained resequencing buffers. (deposited 26 Oct 2010 15:24) [Currently Displayed]
- Depositors only (login required):