ThaiScience  


ENGINEERING JOURNAL CHIANG MAI UNIVERSITY


Volume 25, No. 02, Month AUGUST, Year 2018, Pages 34 - 43


Multi-objective sequencing problem on mixed-model multi-manned assembly lines

Karan Kanpai and Parames Chutima


Abstract Download PDF

Multi-objective sequencing problem on mixed-model multi-manned assembly lines is known to be NP-hard resulting in being nearly impossible to obtain an optimal solution for practical problems. This paper presents a method called Combinatorial Optimization with Coincidence Expand Algorithm (COIN-E) for the sequencing problem. Three objectives are simultaneously considered; minimum production rates variance, minimum utility work, and minimum setup times. The results from the experiments clearly show that COIN-E has better performances than Non-dominated Sorting Genetic Algorithms (NSGA-II), which is another well-known algorithm, in terms of convergence to the Pareto-optimal set, spread of solutions, ratio of non-dominated solution, and computation time to solution.


Keywords

None



ENGINEERING JOURNAL CHIANG MAI UNIVERSITY


Published by : Faculty of Engineering Chiang Mai University
Contributions welcome at : http://researchs.eng.cmu.ac.th/?name=journal