1
Department of Indusrial Engineering, Amirkabir University of Technology, Tehran, Iran
2
Department of Industrial Management, Shahid Beheshti University,G.C., Tehran, Iran
Abstract
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other existing algorithms. The effectiveness of IGA is demonstrated through comparison.
Naderi, B., Zandieh, M., Fatemi Ghomi, S. (2010). An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence
Dependent Setup Times to Minimize Total Weighted Completion Time. Journal of Optimization in Industrial Engineering, Volume 2(Issue 3), 33-37.
MLA
Bahman Naderi; mostafa Zandieh; Seyed Mohammad Taghi Fatemi Ghomi. "An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence
Dependent Setup Times to Minimize Total Weighted Completion Time". Journal of Optimization in Industrial Engineering, Volume 2, Issue 3, 2010, 33-37.
HARVARD
Naderi, B., Zandieh, M., Fatemi Ghomi, S. (2010). 'An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence
Dependent Setup Times to Minimize Total Weighted Completion Time', Journal of Optimization in Industrial Engineering, Volume 2(Issue 3), pp. 33-37.
VANCOUVER
Naderi, B., Zandieh, M., Fatemi Ghomi, S. An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence
Dependent Setup Times to Minimize Total Weighted Completion Time. Journal of Optimization in Industrial Engineering, 2010; Volume 2(Issue 3): 33-37.
)