IDEAS home Printed from https://ideas.repec.org/a/ids/ijpmbe/v8y2018i4p490-515.html
   My bibliography  Save this article

Solving a multi-manned assembly line balancing problem in a Pareto sense

Author

Listed:
  • Parames Chutima
  • Krit Prasert

Abstract

This paper presents a novel algorithm which modifies the coincident algorithm (COIN), namely the adaptive extended coincident algorithm (AE-COIN), to solve a multi-manned assembly line balancing problem (MALBP). The multiple objectives are optimised in a hierarchical manner comprising of the following objectives: 1) minimise the number of workers; 2) minimise the number of stations; 3) balance workloads between stations and maximise work relatedness. The objectives in the third hierarchy are optimised in a Pareto sense since they are conflicting in nature. The performances of AE-COIN are compared against well-known algorithms, i.e., BBO, NSGA II and DPSO. The experimental results show that AE-COIN outperforms its contestants in both solution quality and diversity.

Suggested Citation

  • Parames Chutima & Krit Prasert, 2018. "Solving a multi-manned assembly line balancing problem in a Pareto sense," International Journal of Process Management and Benchmarking, Inderscience Enterprises Ltd, vol. 8(4), pages 490-515.
    • Handle: RePEc:ids:ijpmbe:v:8:y:2018:i:4:p:490-515
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=95056
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

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


    Cited by:

    1. 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).

    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:ids:ijpmbe:v:8:y:2018:i:4:p:490-515. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=95 .

    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.