Name
Title | ||
|---|---|---|
Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms. |
Abstract | ||
|---|---|---|
• Three variants of IG algorithms are presented based on VNS, VND, RNS to solve the distributed no-wait flow shop scheduling problem (DNWFSP).• An improved NEH heuristic is proposed to generate a promising initial solution.• Four local search methods based on neighborhood properties are proposed.• Several speed-up methods are investigated to reduce the evaluation.• The best solutions of 720 instances for DNWFSP are proposed. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.knosys.2017.09.026 | Knowledge-Based Systems |
Keywords | Field | DocType |
Distributed no-wait flow shop scheduling problem,Makespan,Iterated greedy algorithm,Neighborhood structures,Local search | Heuristic,Mathematical optimization,Job shop scheduling,Variable neighborhood search,Local optimum,Computer science,Flow shop scheduling,Algorithm,Production line,Local search (optimization),Design of experiments | Journal |
Volume | Issue | ISSN |
137 | C | 0950-7051 |
Citations | PageRank | References |
10 | 0.45 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weishi Shao | 1 | 33 | 3.44 |
| De-Chang Pi | 2 | 177 | 39.40 |
| Zhongshi Shao | 3 | 92 | 7.91 |