Treffer: Performance evaluation of hybrid-CLP vs. GA: non-permutation flowshop with constrained resequencing buffers

Title:
Performance evaluation of hybrid-CLP vs. GA: non-permutation flowshop with constrained resequencing buffers
Source:
International journal of manufacturing technology and management. 20(1-4):242-258
Publisher Information:
Genève: Inderscience Publishers, 2010.
Publication Year:
2010
Physical Description:
print, 1 p.3/4
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Institut d'Organització i Control de Sistemes Industrials, Universitat Politècnica de Catalunya, Av. Diagonal 647, 08028 Barcelona, Spain
The Center for Heuristic Optimisation, Kent Business School, University of Kent, Canterbury, Kent CT2 7PE, United Kingdom
ISSN:
1368-2148
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.22753033
Database:
PASCAL Archive

Weitere Informationen

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.