IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v54y2016i11p3429-3451.html
   My bibliography  Save this article

Stochastic two-sided U-type assembly line balancing: a genetic algorithm approach

Author

Listed:
  • Yılmaz Delice
  • Emel Kızılkaya Aydoğan
  • Uğur Özcan

Abstract

In this paper, a novel stochastic two-sided U-type assembly line balancing (STUALB) procedure, an algorithm based on the genetic algorithm and a heuristic priority rule-based procedure to solve STUALB problem are proposed. With this new proposed assembly line design, all advantages of both two-sided assembly lines and U-type assembly lines are combined. Due to the variability of the real-life conditions, stochastic task times are also considered in the study. The proposed approach aims to minimise the number of positions (i.e. the U-type assembly line length) as the primary objective and to minimise the number of stations (i.e. the number of operators) as a secondary objective for a given cycle time. An example problem is solved to illustrate the proposed approach. In order to evaluate the efficiency of the proposed algorithm, test problems taken from the literature are used. The experimental results show that the proposed approach performs well.

Suggested Citation

  • Yılmaz Delice & Emel Kızılkaya Aydoğan & Uğur Özcan, 2016. "Stochastic two-sided U-type assembly line balancing: a genetic algorithm approach," International Journal of Production Research, Taylor & Francis Journals, vol. 54(11), pages 3429-3451, June.
    • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:11:p:3429-3451
    DOI: 10.1080/00207543.2016.1140918
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2016.1140918
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2016.1140918?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Scholl, Armin & Voß, S., 1994. "A note on fast , effective heuristics for simple assembly line balancing problems," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 8555, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    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


    Cited by:

    1. Minghai Yuan & Hongyan Yu & Jinting Huang & Aimin Ji, 2019. "Reconfigurable assembly line balancing for cloud manufacturing," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2391-2405, August.
    2. Li, Zixiang & Kucukkoc, Ibrahim & Zhang, Zikai, 2020. "Branch, bound and remember algorithm for two-sided assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 284(3), pages 896-905.
    3. Diefenbach, Johannes & Stolletz, Raik, 2022. "Stochastic assembly line balancing: General bounds and reliability-based branch-and-bound algorithm," European Journal of Operational Research, Elsevier, vol. 302(2), pages 589-605.
    4. Boysen, Nils & Schulze, Philipp & Scholl, Armin, 2022. "Assembly line balancing: What happened in the last fifteen years?," European Journal of Operational Research, Elsevier, vol. 301(3), pages 797-814.
    5. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. S D Lapierre & A B Ruiz, 2004. "Balancing assembly lines: an industrial case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 589-597, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:taf:tprsxx:v:54:y:2016:i:11:p:3429-3451. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.