A production system which consists of a number of parallel assembly lines is considered. On each line a certain product is manufactured observing a common 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 them. The objective is to minimize the number of operators required. This problem is called Multiproduct Parallel Assembly Lines Balancing Problem (MPALBP) and has previously been considered by Gökçen, Agpak, and Benzer (Internat. J. Product. Economics 103, 600-609). In the paper on hand, we give a detailed problem description and model the problem as a binary linear program. Furthermore, an exact solution approach based on an extension of the well-known branch and bound procedure SALOME is proposed. Computational experiments show that this procedure clearly outperforms other approaches as it is able to solve small- to medium-sized problem instances to optimality and provides good heuristic solutions for large-sized problems.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Order Information: Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.
For technical questions regarding this item, or to correct its listing, contact: ().
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: