Heuristic methods for cost-oriented assembly line balancing: A survey
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.
(This abstract was borrowed from another version of this item.)
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Matthias Amen, 2003.
"An exact method for cost-oriented assembly line balancing,"
GE, Growth, Math methods
0309002, EconWPA, revised 09 Sep 2003.
- Amen, Matthias, 2000. "An exact method for cost-oriented assembly line balancing," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 187-195, March.
- 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).
- Scholl, Armin, 1995. "Balancing and sequencing of assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 9690, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
- \.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.
- Fred M. Tonge, 1965. "Assembly Line Balancing Using Probabilistic Combinations of Heuristics," Management Science, INFORMS, vol. 11(7), pages 727-735, May.
When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:68:y:2000:i:1:p:1-14. 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: (Shamier, Wendy)
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.