Solving a multi-manned assembly line balancing problem in a Pareto sense
Solving a multi-manned assembly line balancing problem in a Pareto sense is a scholarly work, published in 2018 in ''International Journal of Process Management and Benchmarking''. The main subjects of the publication include assembly line, line, hierarchy, Pareto efficiency, multi-objective optimization, mathematical optimization, operations research, warehouse, Pareto principle, job-shop scheduling, and computer science. The 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).