IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v13y2022i1p1-18.html
   My bibliography  Save this article

A Greedy Randomized Adaptive Search for Solving Chance-Constrained U-Shaped Assembly Line Balancing Problem

Author

Listed:
  • Mohammad Zakaraia

    (Cairo University, Egypt)

  • Hegazy Zaher

    (Cairo University, Egypt)

  • Naglaa Ragaa

    (Cairo University, Egypt)

Abstract

This paper discusses the U-shaped assembly line balancing problem in case of stochastic processing time. The problem is formulated using chance-constrained programming and the greedy randomized adaptive search procedure is used to solve the problem. In order to prove the efficiency of the proposed algorithm, 71 problems taken from well-known benchmarks are solved and compared with the theoretical lower bound and 13 of them were compared with another approach used to solve the same problem in another paper, which is beam search. The results show that 59 problems are the same as the theoretical aspiration lower bound. In addition, the results of 11 of 13 problems compared with beam search are the same and the results of 2 problems are better than beam search. The t-test statistics is applied and showed that there is no significance difference between the proposed algorithm and the theoretical lower bound thus, the proposed algorithm shows efficiency when compared with the aspired values of the theoretical lower bound.

Suggested Citation

  • Mohammad Zakaraia & Hegazy Zaher & Naglaa Ragaa, 2022. "A Greedy Randomized Adaptive Search for Solving Chance-Constrained U-Shaped Assembly Line Balancing Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 13(1), pages 1-18, January.
    • Handle: RePEc:igg:jamc00:v:13:y:2022:i:1:p:1-18
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.298310
    Download Restriction: no
    ---><---

    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:igg:jamc00:v:13:y:2022:i:1:p:1-18. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.