An exact method for cost-oriented assembly line balancing
After a characterization of the cost-oriented assembly line balancing problem it will be shown that by loading the stations maximally the cost-oriented optimum can be missed. Instead of loading the stations maximally the criterion two-stations-rule a has to be used. For generating optimal solutions an exact backtracking method is introduced in which the enumeration process is limited by modied and new bounding rules. Results of an experimental investigation show that the new method finds optimal solutions for small and medium-sized problem instances in acceptable time.
|Date of creation:||09 Sep 2003|
|Date of revision:||09 Sep 2003|
|Note:||Type of Document - pdf; pages: 9 ; figures: 3 figures, 2 tables. exact method has been implemented successfully in an production plant for household durables|
|Contact details of provider:|| Web page: http://econwpa.repec.org|
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.:
- James R. Jackson, 1956. "A Computing Procedure for a Line Balancing Problem," Management Science, INFORMS, vol. 2(3), pages 261-271, April.
- Roger V. Johnson, 1988. "Optimally Balancing Large Assembly Lines with "Fable"," Management Science, INFORMS, vol. 34(2), pages 240-253, February.
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpge:0309002. 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 references are entirely missing, you can add them using this form.