GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weight completion times
Year of publication: |
2012
|
---|---|
Authors: | Rodriguez, F. J. ; Blum, C. ; García-Martínez, C. ; Lozano, M. |
Published in: |
Annals of operations research. - Dordrecht, The Netherlands : Springer Nature B.V., ISSN 0254-5330, ZDB-ID 252629-3. - Vol. 201.2012, p. 383-401
|
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Heuristik | Heuristics | Durchlaufzeit | Lead time |
-
Ozturk, Onur, (2017)
-
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne, (2015)
-
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Fomin, Artem, (2022)
- More ...
-
Rodriguez, F. J., (2012)
-
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
Rodriguez, Francisco J., (2013)
-
Tabu-enhanced iterated greedy algorithm : a case study in the quadratic multiple knapsack problem
García Martínez, Carlos, (2014)
- More ...