IDEAS home Printed from
   My bibliography  Save this article

Assembly Line Balancing Using Probabilistic Combinations of Heuristics


  • Fred M. Tonge

    (University of California, Irvine)


Several 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.

Suggested Citation

  • Fred M. Tonge, 1965. "Assembly Line Balancing Using Probabilistic Combinations of Heuristics," Management Science, INFORMS, vol. 11(7), pages 727-735, May.
  • Handle: RePEc:inm:ormnsc:v:11:y:1965:i:7:p:727-735

    Download full text from publisher

    File URL:
    Download Restriction: no


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

    Cited by:

    1. 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.
    2. 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.
    3. 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.
    4. Boysen, Nils & Fliedner, Malte, 2008. "A versatile algorithm for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 184(1), pages 39-56, January.
    5. Lourenco, Lidia Lampreia & Pato, Margarida Vaz, 2007. "The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem," European Journal of Operational Research, Elsevier, vol. 183(1), pages 181-196, November.
    6. 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.
    7. Patrick McMullen & Gregory Frazier, 1999. "Using Simulation and Data Envelopment Analysis to Compare Assembly Line Balancing Solutions," Journal of Productivity Analysis, Springer, vol. 11(2), pages 149-168, April.

    More about this item


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:11:y:1965:i:7:p:727-735. 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: (Mirko Janc). General contact details of provider: .

    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.

    We have no references for this item. You can help adding them by using 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.