An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time

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 propose...

Full description

Bibliographic Details
Main Authors: Bahman Naderi, mostafa Zandieh, Seyed Mohammad Taghi Fatemi Ghomi
Format: Article
Language:English
Published: Islamic Azad University, Qazvin Branch 2010-02-01
Series:Journal of Optimization in Industrial Engineering
Subjects:
Online Access:http://www.qjie.ir/article_19_b2fde86431e5878d5f8b97c4f4c85290.pdf

Similar Items