IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v16y2013i3p289-309.html
   My bibliography  Save this article

A cost-oriented model for balancing mixed-model assembly lines with multi-manned workstations

Author

Listed:
  • Abolfazl Kazemi
  • Abdolhossein Sedighi

Abstract

In many real world assembly line systems which the work-piece is of large size more than one worker work on the same work-piece in each station. This type of assembly line is called multi-manned assembly line (MAL). In this paper, a cost-oriented approach is used to model the mixed model multi-manned assembly line balancing problem (MMALBP) with the aim of minimising total cost per production unit. A mathematical model is developed to solve the problem. Since the proposed model is NP-hard, a genetic algorithm (GA) and a particle swarm optimisation (PSO) algorithm are proposed to efficiently solve the problem. Parameters and operators of both algorithms are selected using the design of experiments (DOE) method. Several examples are solved to illustrate the proposed model and the algorithms.

Suggested Citation

  • Abolfazl Kazemi & Abdolhossein Sedighi, 2013. "A cost-oriented model for balancing mixed-model assembly lines with multi-manned workstations," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 16(3), pages 289-309.
    • Handle: RePEc:ids:ijsoma:v:16:y:2013:i:3:p:289-309
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=56765
    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. Lopes, Thiago Cantos & Pastre, Giuliano Vidal & Michels, Adalberto Sato & Magatão, Leandro, 2020. "Flexible multi-manned assembly line balancing problem: Model, heuristic procedure, and lower bounds for line length minimization," Omega, Elsevier, vol. 95(C).
    2. Andreu-Casas, Enric & García-Villoria, Alberto & Pastor, Rafael, 2022. "Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints," European Journal of Operational Research, Elsevier, vol. 302(1), pages 96-116.
    3. Murat Şahin & Talip Kellegöz, 2023. "Benders’ decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers," Annals of Operations Research, Springer, vol. 321(1), pages 507-540, February.
    4. Talip Kellegöz, 2017. "Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method," Annals of Operations Research, Springer, vol. 253(1), pages 377-404, June.
    5. Michels, Adalberto Sato & Lopes, Thiago Cantos & Magatão, Leandro, 2020. "An exact method with decomposition techniques and combinatorial Benders’ cuts for the type-2 multi-manned assembly line balancing problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    6. Michels, Adalberto Sato & Lopes, Thiago Cantos & Sikora, Celso Gustavo Stall & Magatão, Leandro, 2019. "A Benders’ decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 278(3), pages 796-808.

    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:ijsoma:v:16:y:2013:i:3:p:289-309. 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=150 .

    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.