An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Year of publication: |
2022
|
---|---|
Authors: | Fomin, Artem ; Goldengorin, Boris |
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. 142.2022, p. 1-11
|
Subject: | Benchmark | Branch and bound | Equal processing times | Heuristic | Preemptive scheduling | Total weighted completion time | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Theorie | Theory | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
Lee, Jun-ho, (2021)
-
Joo, B.-J., (2009)
-
Li, Xiangyong, (2011)
- More ...
-
Gutin, Gregory, (2008)
-
Maximization of submodular functions : theory and enumeration algorithms
Goldengorin, Boris, (2009)
-
Optimal supplier choice with discounting
Goldengorin, Boris, (2011)
- More ...