Advanced Search
MyIDEAS: Login to save this paper or follow this series

Heuristic methods for cost-oriented assembly line balancing: a survey

Contents:

Author Info

  • Matthias Amen

    (University of Duisburg & Essen)

Abstract

This paper is concerned with cost-oriented assembly line balancing. This problem occurs especially in the final assembly of automotives, consumer durables or personal computers, where production is still very labour- intensive, and where the wage rates depend on the requirements and qualifications to fulfil the work. First a short problem description is presented. After that a classi"cation of existent and new heuristic methods for solving this problem is given. The heuristic methods presented in this paper are described in detail. A new priority rule called ` best change of idle cost a is proposed. This priority rule di!ers from the existent priority rules because it is the only one which considers that production cost are the result of both, production time and cost rates. Furthermore a new sophisticated method called ` exact solution of sliding problem windows a is presented. The solution process is illustrated by an example, showing how this metaheuristic works together with an exact method.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. 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.
File URL: http://128.118.178.162/eps/ge/papers/0309/0309003.pdf
Download Restriction: no

Bibliographic Info

Paper provided by EconWPA in its series GE, Growth, Math methods with number 0309003.

as in new window
Length: 14 pages
Date of creation: 09 Sep 2003
Date of revision: 09 Sep 2003
Handle: RePEc:wpa:wuwpge:0309003

Note: Type of Document - pdf; pages: 14 ; figures: 10 figures, 4 tables. Published in International Journal of Production Economics, Vol. 68, No. 1, 30 October, 2000, pp. 1-14.
Contact details of provider:
Web page: http://128.118.178.162

Related research

Keywords: Assembly line balancing; Cost-oriented production planning; Heuristic methods;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Scholl, Armin, 1999. "Balancing and sequencing of assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 10881, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
  2. Matthias Amen, 2003. "An exact method for cost-oriented assembly line balancing," GE, Growth, Math methods 0309002, EconWPA, revised 09 Sep 2003.
  3. \.Ilker Baybars, 1986. "A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem," Management Science, INFORMS, vol. 32(8), pages 909-932, August.
  4. Fred M. Tonge, 1965. "Assembly Line Balancing Using Probabilistic Combinations of Heuristics," Management Science, INFORMS, vol. 11(7), pages 727-735, May.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Nils Boysen & Malte Fliedner & Armin Scholl, 2006. "Assembly line balancing: Which model to use when?," Jenaer Schriften zur Wirtschaftswissenschaft 23/2006, Friedrich-Schiller-Universit├Ąt Jena, Wirtschaftswissenschaftliche Fakult├Ąt.
  2. Kahan, Tomer & Bukchin, Yossi & Menassa, Roland & Ben-Gal, Irad, 2009. "Backup strategy for robots' failures in an automotive assembly system," International Journal of Production Economics, Elsevier, vol. 120(2), pages 315-326, August.
  3. Matthias Amen, 2003. "Heuristic methods for cost-oriented assembly line balancing: a comparison on solution quality and computing time," GE, Growth, Math methods 0309004, EconWPA, revised 09 Sep 2003.
  4. Sternatz, Johannes, 2014. "Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry," European Journal of Operational Research, Elsevier, vol. 235(3), pages 740-754.
  5. Guschinskaya, Olga & Dolgui, Alexandre, 2009. "Comparison of exact and heuristic methods for a transfer line balancing problem," International Journal of Production Economics, Elsevier, vol. 120(2), pages 276-286, August.
  6. Gamberini, Rita & Grassi, Andrea & Rimini, Bianca, 2006. "A new multi-objective heuristic algorithm for solving the stochastic assembly line re-balancing problem," International Journal of Production Economics, Elsevier, vol. 102(2), pages 226-243, August.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpge:0309003. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.