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

Parames Chutima and Krit Prasert

International Journal of Process Management and Benchmarking, 2018, vol. 8, issue 4, 490-515

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.

Keywords: assembly line balancing; ALB; multi-manned; coincident algorithm. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=95056 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijpmbe:v:8:y:2018:i:4:p:490-515

Access Statistics for this article

More articles in International Journal of Process Management and Benchmarking from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().