Title | ||
---|---|---|
An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem. |
Abstract | ||
---|---|---|
•An iterated greedy algorithm for the total tardiness parallel blocking flow shop problem.•Constructive heuristics which considers the characteristics of the problem.•Design of experiments to calibrate and select the best variant. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1016/j.eswa.2018.12.039 | Expert Systems with Applications |
Keywords | Field | DocType |
Parallel flow shop,Distribution flow shop,Blocking,Scheduling,Total tardiness | Data mining,Mathematical optimization,Tardiness,Critical line,Constructive,Computer science,CPU time,Scheduling (computing),Permutation,Flow shop scheduling,Minification | Journal |
Volume | ISSN | Citations |
121 | 0957-4174 | 6 |
PageRank | References | Authors |
0.41 | 15 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Imma Ribas | 1 | 77 | 5.30 |
Ramón Companys | 2 | 12 | 2.02 |
Xavier Tort-martorell | 3 | 28 | 4.78 |