An Iterated Greedy Algorithm for Flexible Flow Lines with SequenceDependent Setup Times to Minimize Total Weighted Completion Time
محورهای موضوعی : Design of Experiment
Bahman Naderi
1
(Department of Indusrial Engineering, Amirkabir University of Technology, Tehran, Iran)
mostafa Zandieh
2
(Department of Industrial Management, Shahid Beheshti University,G.C., Tehran, Iran)
Seyed Mohammad Taghi Fatemi Ghomi
3
(Department of Indusrial Engineering, Amirkabir University of Technology, Tehran, Iran)
کلید واژه: Scheduling, flexible flow line, sequence dependent setup time, iterated greedy algorithm,
چکیده مقاله :
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.
