Strongly fully polynominal time approximation scheme for the weighted completion time minimization problem on two-parallel capacitated machines
| Year of publication: |
October-December 2017
|
|---|---|
| Authors: | Kacem, Imed ; Sahnoune, Myriam ; Schmidt, Günter |
| Published in: |
RAIRO. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 51.2017, 4, p. 1177-1188
|
| Subject: | Scheduling | parallel machine | approximation | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Produktionssteuerung | Production control |
-
Bi-objective parallel machine scheduling with additional resources during setups
Yepes-Borrero, Juan C., (2021)
-
Fang, Kan, (2021)
-
Bilinear branch and check for unspecified parallel machine scheduling with shift consideration
Jartnillaphand, Ponpot, (2025)
- More ...
-
Schroeder, Pascal, (2019)
-
Kacem, Imed, (2009)
-
Kacem, Imed, (2008)
- More ...