Extending metaheuristics based on bin packing for SALBP to PALBP
by Nathalie Grangeon; Sylvie Norre
European J. of Industrial Engineering (EJIE), Vol. 6, No. 6, 2012

Abstract: Parallel assembly line balancing problem (PALBP) considers a production system which consists of many parallel assembly lines. On each line, a product of a given type is manufactured according to the same cycle time. By arranging the lines in a favourable manner, it is possible to increase efficiency of the production system by combining stations of neighbouring lines when balancing the lines, i.e., an operator can work on two adjacent lines. The objective is to minimise the number of required operators. This problem has been considered first by Gökçen et al. (2006). We have already proposed efficient metaheuristics for SALBP-1. In this paper, we propose to investigate the link between SALBP-1 and PALBP and to adapt our metaheuristics for this problem. Two cases are considered. [Received 10 September 2009; Revised 10 June 2010; Accepted 23 November 2010]

Online publication date: Wed, 10-Sep-2014

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 European J. of Industrial Engineering (EJIE):
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