This paper is focused on the solution quality and computing time requirements of heuristic methods for cost-oriented assembly line balancing. It is based on a recent paper (Amen, International Journal of Production Economics 68 (2000), which describes in detail the solution process of existent and two new heuristics. After a short review of the historic origin and the wideness of assembly line systems in present day industry, the paper emphasizes the economic view of production in order to cut down production cost. Results of a worst-case analysis concerning the solution quality and the computing time are presented. An interval for the worst-case-solution quality for most heuristic methods is given. The results of an experimental investigation show that the new priority rule "best change of idle cost" (Amen) achieves significantly better solutions than the existent priority rules. Furthermore, the new method "exact solution of sliding problem windows" (Amen) has been found to be the best heuristic method known so far.
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.
Length: 10 pages Date of creation: 09 Sep 2003 Date of revision:
09 Sep 2003 Handle: RePEc:wpa:wuwpge:0309004
Note: Type of Document - pdf; pages: 10 ; figures: 2 tables. Published in International Journal of Production Economics, Vol. 69, No. 3, 13 February 2001 Contact details of provider: Web page: http://129.3.20.41
For technical questions regarding this item, or to correct its listing, contact: (EconWPA).
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.: