Name
Abstract | ||
|---|---|---|
In this work we consider the well-known one-machine total completion time sequencing problem subject to release times. We present a very large scale neighborhood search heuristic based on mathematical programming. This heuristic makes use of the positional completion time formulation of the problem in which valid inequalities are added. The proposed procedure compares favorably with the state of the art heuristics. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.cor.2013.11.016 | Computers & OR |
Keywords | DocType | Volume |
release time,art heuristics,positional completion time formulation,mathematical programming,valid inequality,proposed procedure,well-known one-machine total completion,single machine scheduling,large scale neighborhood search,problem subject,hybrid heuristic approach | Journal | 45, |
ISSN | Citations | PageRank |
0305-0548 | 6 | 0.46 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Federico Della Croce | 1 | 399 | 41.60 |
| Fabio Salassa | 2 | 56 | 9.79 |
| Vincent T'kindt | 3 | 203 | 21.04 |