Approximation algorithms for makespan minimization on identical parallel machines under resource constraints
Year of publication: |
2021
|
---|---|
Authors: | Strusevich, Vitaly A. |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 72.2021, 9, p. 2135-2146
|
Subject: | approximation | group technology | Parallel identical machines | resource constraints | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Mathematische Optimierung | Mathematical programming |
-
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
Alhadi, Gais, (2020)
-
Ravi, Peruvemba Sundaram, (2016)
-
Cohen, Edut, (2025)
- More ...
-
Two-machine open shop scheduling with an availability constraint
Breit, Joachim, (2000)
-
Non-preemptive two-machine open shop scheduling with non-availability constraints
Breit, Joachim, (2001)
-
Kellerer, Hans, (2009)
- More ...