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 / Operations research. - 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 | Heuristik | Heuristics | Produktionssteuerung | Production control | Durchlaufzeit | Lead time |
-
Huo, Yumei, (2015)
-
Scheduling to minimize the maximum total completion time per machine
Wan, Long, (2015)
-
An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
Ribas, Imma, (2013)
- More ...
-
Schroeder, Pascal, (2019)
-
Kacem, Imed, (2008)
-
Kacem, Imed, (2008)
- More ...