Name
Title | ||
|---|---|---|
Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem. |
Abstract | ||
|---|---|---|
This research considers a flexible flowshop sequence-dependent group scheduling problem with minimization of total completion time. A mixed integer linear mathematical model for the research problem is developed. Since the research problem is shown to be strongly NP-hard, a metaheuristic algorithm based on memetic algorithm (MA) is proposed. A lower bounding method based on the Branch and Price algorithm is also proposed to evaluate the quality of the MA. In order to evaluate the performance of the proposed algorithms, random test problems, ranging in size from small, medium, to large are generated and solved by the MA and the lower bounding method. The results show that the average percentage gap of the MA is 6.03 % compared to the result of the lower bounding method for randomly generated test problems. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10479-014-1667-6 | Annals OR |
Keywords | Field | DocType |
Flexible flowshop,Group scheduling,Sequence-dependent setup time,Branch and price algorithm,lower bound,memetic algorithm | Integer,Memetic algorithm,Mathematical optimization,Upper and lower bounds,Branch and price,Minification,Ranging,Mathematics,Metaheuristic,Bounding overwatch | Journal |
Volume | Issue | ISSN |
226 | 1 | 0254-5330 |
Citations | PageRank | References |
6 | 0.43 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Taha Keshavarz | 1 | 6 | 0.43 |
| Nasser Salmasi | 2 | 70 | 4.86 |
| Mohsen Varmazyar | 3 | 6 | 0.77 |