An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
Abstract
Although computationally feasible optimizing algorithms for solving the production line balancing problem have not been found, a number of computational techniques have been devised and used to obtain solutions which are not necessarily optimal solutions but are hoped to be good solutions. In the study the most prominent of these techniques are examined and compared by applying them to a sample of production line balancing problems. The maximum output rate attained for a specified line length is used as the measure of effectiveness and the computing time required to make line balancing calculations for a specified output rate is used as the measure of cost. The central results of the study show that there are significant differences among the effectiveness results achieved by the line balancing techniques. Although the differences are not large, there are few changes in the relative effectiveness of the computing techniques over the range of line lengths, partial ordering strengths, and problem sizes that were investigated. For the larger problems the computing time differences are significant and in some instances are a more important consideration in the relative evaluation of the computing techniques than are the effectiveness results.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.Bibliographic Info
Article provided by INFORMS in its journal Management Science.
Volume (Year): 16 (1970)
Issue (Month): 11 (July)
Pages: 728-746
Contact details of provider:
Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
Phone: +1-443-757-3500
Fax: 443-757-3515
Email:
Web page: http://www.informs.org/
More information through EDIRC
Related research
Keywords:References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.Cited by:
- De Reyck, Bert & Herroelen, Willy, 1999. "The multi-mode resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 119(2), pages 538-556, December.
- Aase, Gerald R. & Olson, John R. & Schniederjans, Marc J., 2004. "U-shaped assembly line layouts and their impact on labor productivity: An experimental study," European Journal of Operational Research, Elsevier, vol. 156(3), pages 698-711, August.
- Rubinovitz, J. & Levitin, G., 1995. "Genetic algorithm for assembly line balancing," International Journal of Production Economics, Elsevier, vol. 41(1-3), pages 343-354, October.
- Van de Vonder, Stijn & Demeulemeester, Erik & Herroelen, Willy & Leus, Roel, 2005. "The use of buffers in project management: The trade-off between stability and makespan," International Journal of Production Economics, Elsevier, vol. 97(2), pages 227-240, August.
- Amen, Matthias, 2001.
"Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time,"
International Journal of Production Economics,
Elsevier, vol. 69(3), pages 255-264, February.
- 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.
- Vanhoucke, Mario & Demeulemeester, Erik & Herroelen, Willy, 2003. "Progress payments in project scheduling problems," European Journal of Operational Research, Elsevier, vol. 148(3), pages 604-620, August.
- Wei, Wenchao & Coolen, Kris & Leus, Roel, 2012. "Sequential testing policies for complex systems under precedence constraints," Open Access publications from Katholieke Universiteit Leuven urn:hdl:123456789/350496, Katholieke Universiteit Leuven.
- De Reyck, Bert & Herroelen, willy, 1998. "A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 111(1), pages 152-174, November.
- Fatih Ugurdag, H. & Rachamadugu, Ram & Papachristou, Christos A., 1997. "Designing paced assembly lines with fixed number of stations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 488-501, November.
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:16:y:1970:i:11:p:728-746For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
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.