Advanced Search
MyIDEAS: Login

A methodology for solving single-model, stochastic assembly line balancing problem

Contents:

Author Info

  • Sarin, Subhash C.
  • Erel, Erdal
  • Dar-El, Ezey M.
Registered author(s):

    Abstract

    In this paper, a methodology is developed to solve the single-model, stochastic assembly line balancing problem for the objective of minimizing the total labor cost and the expected incompletion cost arising from tasks not completed within the prescribed cycle time. The methodology is based on determining an initial DP based solution and its improvement using a branch-and-bound procedure which uses an approximate solution instead of a lower bound for fathoming nodes. Detailed experimentation shows the superiority of this method over the most promising one from the literature.

    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://www.sciencedirect.com/science/article/B6VC4-3X3KB65-3/2/0b82b44445b22daa888dc9fd424e9295
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Omega.

    Volume (Year): 27 (1999)
    Issue (Month): 5 (October)
    Pages: 525-535

    as in new window
    Handle: RePEc:eee:jomega:v:27:y:1999:i:5:p:525-535

    Contact details of provider:
    Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description

    Order Information:
    Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
    Web: https://shop.elsevier.com/order?id=375&ref=375_01_ooc_1&version=01

    Related research

    Keywords: Assembly Line balancing Heuristics;

    References

    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. Fred N. Silverman & John C. Carter, 1986. "A Cost-Based Methodology for Stochastic Line Balancing with Intermittent Line Stoppages," Management Science, INFORMS, vol. 32(4), pages 455-463, April.
    2. Allan L. Gutjahr & George L. Nemhauser, 1964. "An Algorithm for the Line Balancing Problem," Management Science, INFORMS, vol. 11(2), pages 308-315, November.
    3. Chakravarty, Amiya K. & Shtub, Avraham, 1986. "A cost minimization procedure for mixed model production lines with normally distributed task times," European Journal of Operational Research, Elsevier, vol. 23(1), pages 25-36, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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

    Cited by:
    1. Aase, Gerald R. & Olson, John R. & Schniederjans, Marc J., 2004. "U-shaped assembly line layouts and their impact on labor productivity: An experimental study," European Journal of Operational Research, Elsevier, vol. 156(3), pages 698-711, August.
    2. Battaïa, Olga & Dolgui, Alexandre, 2013. "A taxonomy of line balancing problems and their solutionapproaches," International Journal of Production Economics, Elsevier, vol. 142(2), pages 259-277.
    3. Delorme, Xavier & Dolgui, Alexandre & Kovalyov, Mikhail Y., 2012. "Combinatorial design of a minimum cost transfer line," Omega, Elsevier, vol. 40(1), pages 31-41, January.
    4. 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.
    5. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2008. "Assembly line balancing: Which model to use when," International Journal of Production Economics, Elsevier, vol. 111(2), pages 509-528, February.
    6. Gamberini, Rita & Grassi, Andrea & Rimini, Bianca, 2006. "A new multi-objective heuristic algorithm for solving the stochastic assembly line re-balancing problem," International Journal of Production Economics, Elsevier, vol. 102(2), pages 226-243, August.
    7. Hamta, Nima & Fatemi Ghomi, S.M.T. & Jolai, F. & Akbarpour Shirazi, M., 2013. "A hybrid PSO algorithm for a multi-objective assembly line balancing problem with flexible operation times, sequence-dependent setup times and learning effect," International Journal of Production Economics, Elsevier, vol. 141(1), pages 99-111.

    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:eee:jomega:v:27:y:1999:i:5:p:525-535. 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: (Zhang, Lei).

    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.