MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
Year of publication: |
2022
|
---|---|
Authors: | Balogh, Andrea ; Garraffa, Michele ; O'Sullivan, Barry ; Salassa, Fabio |
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. 146.2022, p. 1-15
|
Subject: | Scheduling | Flowshop | No-idle | MILP | Hybrid heuristics | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Evolutionärer Algorithmus | Evolutionary algorithm | Theorie | Theory |
-
Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
Chaves, Antonio A., (2016)
-
Fernandez-Viagas, Victor, (2019)
-
Pixelation of time matrices for solving permutation flowshop scheduling problem
Farahmand Rad, Shahriar, (2024)
- More ...
-
The one-dimensional cutting stock problem with sequence-dependent cut losses
Garraffa, Michele, (2016)
-
A hybrid three-phase approach for the max-mean dispersion problem
Della Croce, Federico, (2016)
-
Udvariasság és sértés a számítógépes játékokban − pragmatikai szempontból
Balogh, Andrea, (2019)
- More ...