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...
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
-
A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem
by: Ghiath Al Aqel, et al.
Published: (2019-03-01) -
Solving the permutation flow shop problem with blocking and setup time constraints
by: Mauricio Iwama Takano, et al.
Published: (2020-03-01) -
No-Wait Job Shop Scheduling Using a Population-Based Iterated Greedy Algorithm
by: Mingming Xu, et al.
Published: (2021-04-01) -
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
by: Danial Khorasanian, et al.
Published: (2012-11-01) -
Greedy Strategies for Convex Minimization
by: Nguyen, Hao Thanh
Published: (2013)