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

Resource Constrained Assembly Line Balancing Problem Solved with Ranked Positional Weight Rule

  • Hsiu-Hsueh Kao


    (Department of Business Administration, Tamkang University, TAIWAN)

  • Din-Horng Yeh


    (National Chung Cheng University, TAIWAN)

  • Yi-Hsien Wang


    (Chinese Culture University, TAIWAN)

Registered author(s):

    We study a resource constrained assembly line balancing problem (RCALBP) presented by A?pak and G?k?en, who developed a 0-1 integer programming model to find the optimal solution. However, this model is inefficient in solving large-scale problems. In this paper, we propose a simple efficient heuristic that is based on the widely-used ranked positional weight (RPW) rule. The example given by A?pak and G?k?en is used for illustration, and numerical results of sample problems selected from the literature are given to show the effectiveness of the proposed heuristic.

    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:,%20et%20al%20.pdf
    Download Restriction: no

    Article provided by Better Advances Press, Canada in its journal Review of Economics & Finance.

    Volume (Year): 1 (2011)
    Issue (Month): (November)
    Pages: 71-80

    in new window

    Handle: RePEc:bap:journl:110506
    Contact details of provider: Postal: 17 Alton Towers Circle, Unit 101 Toronto, ON, M1V3L8, Canada
    Phone: +1-647-728-3961
    Web page:

    Order Information: Postal: 17 Alton Towers Circle, Unit 101 Toronto, ON, M1V3L8, Canada

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as in new window
    1. James R. Jackson, 1956. "A Computing Procedure for a Line Balancing Problem," Management Science, INFORMS, vol. 2(3), pages 261-271, April.
    2. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
    3. Scholl, Armin & Klein, Robert, 1997. "SALOME. a bidirectional branch and bound procedure for assembly line balancing," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 7890, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. Agpak, Kursad & Gokcen, Hadi, 2005. "Assembly line balancing: Two resource constrained cases," International Journal of Production Economics, Elsevier, vol. 96(1), pages 129-140, April.
    5. Peter A. Pinto & David G. Dannenbring & Basheer M. Khumawala, 1983. "Assembly Line Balancing with Processing Alternatives: An Application," Management Science, INFORMS, vol. 29(7), pages 817-830, July.
    6. Fred M. Tonge, 1960. "Summary of a Heuristic Line Balancing Procedure," Management Science, INFORMS, vol. 7(1), pages 21-42, October.
    7. E. M. Dar-El & Y. Rubinovitch, 1979. "Must--A Multiple Solutions Technique for Balancing Single Model Assembly Lines," Management Science, INFORMS, vol. 25(11), pages 1105-1114, November.
    8. G. M. Buxey, 1974. "Assembly Line Balancing with Multiple Stations," Management Science, INFORMS, vol. 20(6), pages 1010-1021, February.
    9. Allan L. Gutjahr & George L. Nemhauser, 1964. "An Algorithm for the Line Balancing Problem," Management Science, INFORMS, vol. 11(2), pages 308-315, November.
    10. Yamada, Tetsuo & Matsui, Masayuki, 2003. "A management design approach to assembly line systems," International Journal of Production Economics, Elsevier, vol. 84(2), pages 193-204, May.
    Full references (including those not matched with items on IDEAS)

    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:bap:journl:110506. 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: (Bill Yan)

    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.