Publication: Worker allocation in U-shaped assembly lines with multiple objectives
Issued Date
2009-12-01
Resource Type
Other identifier(s)
2-s2.0-77949536104
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management. (2009), 105-109
Suggested Citation
R. Sirovetnukul, P. Chutima Worker allocation in U-shaped assembly lines with multiple objectives. IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management. (2009), 105-109. doi:10.1109/IEEM.2009.5373414 Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/27350
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
Worker allocation in U-shaped assembly lines with multiple objectives
Author(s)
Other Contributor(s)
Abstract
The multi-objective worker allocation problems of single and mixed-model assembly lines having manually operated machines in several fixed U-shaped layouts are developed. Three objective functions are simultaneously minimized, i.e. number of workers, deviation of operation times of workers, and walking time. NSGA-II, an evolutionary optimization algorithm, searches only good solutions from the population, but a selection method should also discard the below-average solutions in order to avoid producing bad solutions. The COINcidence algorithm makes use of both good and not-good solutions with reward and punishment schemes to update a better generator. After getting the first objective of minimum number of workers, the rest are compared between NSGA-II and COIN in four measures for all testing problems. Each of the computational results gives a worker good task assignment and walking path. COIN is preferable to NSGA-II in most cases. ©2009 IEEE.