Extending metaheuristics based on bin packing for SALBP to PALBP

Nathalie Grangeon and Sylvie Norre

European Journal of Industrial Engineering, 2012, vol. 6, issue 6, 713-732

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]

Keywords: metaheuristics; parallel assembly line balancing; PALBP; multi-product; bin packing; parallel assembly lines. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=51073 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:6:y:2012:i:6:p:713-732

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().