Assembly Line Balancing Using Probabilistic Combinations of Heuristics
AbstractSeveral recent research efforts have studied the use of probabilistic schemes for generating solutions to particular combinatorial problems. Characteristically, such schemes include both rapid production of many potential solutions, through repeated application of simple choice rules, and dynamic modification of the production process ("learning"). In this study the simple choice rules (heuristics) used are derived from earlier applications of heuristic programming to the assembly line balancing problem. Repeated trials with probabilistic choice of simple rules are here viewed as an alternative method of organizing the appropriate selection and application of these heuristics. The procedure assigns tasks to work stations along the assembly line by randomly selecting a heuristic for choosing the next task to be added to the current work station. While many suitable heuristics for assembly line balancing have been suggested in the literature, our studies have primarily used the following: choose the task with the largest operation time; choose the task with the most immediate followers; choose a task randomly. The results for studies of several problems, and several cycle times of each problem, can be summarized as follows. Random selection of heuristics for choosing the next task does as well as or better than (i.e., results in fewer work stations than) either use of the individual heuristics alone, or random choice of the tasks directly, without intervening choice of heuristics.
Download InfoIf 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 InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 11 (1965)
Issue (Month): 7 (May)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Zulch, Gert & Braun, Wolfgang J. & Schiller, Emmerich F., 1997. "Analytical approach of determining job division in manual assembly systems," International Journal of Production Economics, Elsevier, vol. 51(1-2), pages 123-134, 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.
- Scholl, Armin & Becker, Christian, 2006.
"State-of-the-art exact and heuristic solution procedures for simple assembly line balancing,"
European Journal of Operational Research,
Elsevier, vol. 168(3), pages 666-693, February.
- Armin Scholl & Christian Becker, 2003. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," Jenaer Schriften zur Wirtschaftswissenschaft 20/2003, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
- Matthias Amen, 2003.
"Heuristic methods for cost-oriented assembly line balancing: a survey,"
GE, Growth, Math methods
0309003, EconWPA, revised 09 Sep 2003.
- Amen, Matthias, 2000. "Heuristic methods for cost-oriented assembly line balancing: A survey," International Journal of Production Economics, Elsevier, vol. 68(1), pages 1-14, October.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.