IDEAS home Printed from
MyIDEAS: Login to save this article or follow this journal

A Comparative Evaluation of Heuristic Line Balancing Techniques

  • F. Brian Talbot

    (University of Michigan, Ann Arbor, Michigan 48109)

  • James H. Patterson

    (Indiana University, Bloomington, Indiana 47401)

  • William V. Gehrlein

    (University of Delaware, Newark, Delaware 19711)

Registered author(s):

    In this paper, we report on a computational experiment designed to assess the efficacy of 26 heuristic decision rules which group work tasks into work stations along an assembly line such that the number of work stations required is minimized. The heuristic decision rules investigated vary from simple list processing procedures that consider a single attribute of each work task for assignment, to procedures which are optimal seeking, but which have had their search terminated through the imposition of a limit on the amount of computation time that can be devoted to each search. Also included are heuristic decision rules which backtrack in an attempt to locate an improved solution, and decision rules which probabilistically search for improved solutions. Our investigation differs from those reported previously, in that the objective in balancing each line is to determine the minimum number of work stations for a given limit on the time available for assembly at each work station (the cycle time). Previous approaches have investigated the problem of determining the minimum cycle time for a given line length. We also compare the results obtained with the optimal solution for a subset of the problems investigated. Both problems which have appeared in the open literature and problems which have been solved for the first time are included. Because a portion of our results differ from those reported previously, we suggest why these differences have occurred. Guidelines are also given to those balancing industrial assembly lines on the choice of the heuristic decision rule to use whether one is attempting to obtain a minimum station balance given a limit on the time available for assembly at each work station, or whether one is attempting to minimize the time devoted to assembly at a work station given a limit on the number of work stations available.

    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:
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 32 (1986)
    Issue (Month): 4 (April)
    Pages: 430-454

    in new window

    Handle: RePEc:inm:ormnsc:v:32:y:1986:i:4:p:430-454
    Contact details of provider: Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:

    More information through EDIRC

    No references listed on IDEAS
    You can help add them by filling out this form.

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

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:32:y:1986:i:4:p:430-454. 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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.