Performance evaluation of hybrid-CLP vs. GA: non-permutation flowshop with constrained resequencing buffers
by Gerrit Farber, Anna M. Coves Moreno, Said Salhi
International Journal of Manufacturing Technology and Management (IJMTM), Vol. 20, No. 1/2/3/4, 2010

Abstract: 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.

Online publication date: Wed, 05-May-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Technology and Management (IJMTM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com