Iterated local search and very large neighborhoods for the parallel-machines total tardiness problems
Year of publication: |
2012
|
---|---|
Authors: | Della Croce, Federico ; Garaix, Thierry ; Grosso, A. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 6, p. 1213-1217
|
Subject: | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | USA | United States | Theorie | Theory |
-
Complexity of the two-stage no-wait assembly problem with setup and removal times separated
Strusevič, Vitalij Aleksandrovič, (1991)
-
Computation of approximate α-points for large scale single machine scheduling problem
Gu, Han Yu, (2008)
-
A path-relinking approach for a bi-criteria disassembly sequencing problem
Adenso-Díaz, Belarmino, (2008)
- More ...
-
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
Della Croce, Federico, (2012)
-
Baptiste, P., (2010)
-
Finding maximin latin hypercube designs by Iterated Local Search heuristics
Grosso, A., (2009)
- More ...