Scheduling semi-malleable jobs to minimize mean flow time
Year of publication: |
2015
|
---|---|
Authors: | Hendel, Yann ; Kubiak, Wieslaw ; Trystram, Denis |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 18.2015, 4, p. 335-343
|
Subject: | Scheduling | Mean flow time | Preemptable jobs | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Produktionssteuerung | Production control | Arbeitsmobilität | Labour mobility | Durchlaufzeit | Lead time |
-
Udaiyakumar, Kuppuswamy Chockalingam, (2015)
-
Scheduling controllable processing time jobs in seru production system with resource allocation
Jiang, Yujing, (2022)
-
Lopez-Esteve, Axel, (2023)
- More ...
-
Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
Hendel, Yann, (2006)
-
Efficient neighborhood search for the one-machine earliness–tardiness scheduling problem
Hendel, Yann, (2006)
-
Promoting cooperation in selfish computational grids
Rzadca, Krzysztof, (2009)
- More ...