Advanced Search
MyIDEAS: Login to save this article or follow this journal

Assembly Line Balancing Using Probabilistic Combinations of Heuristics

Contents:

Author Info

  • Fred M. Tonge

    (University of California, Irvine)

Registered author(s):

    Abstract

    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.

    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.
    File URL: http://dx.doi.org/10.1287/mnsc.11.7.727
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 11 (1965)
    Issue (Month): 7 (May)
    Pages: 727-735

    as in new window
    Handle: RePEc:inm:ormnsc:v:11:y:1965:i:7:p:727-735

    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 IDEAS
    You 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.
    as in new window

    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. 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.
    3. 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.
    4. 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.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

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

    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.