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 | Theorie | Theory | Algorithmus | Algorithm | Heuristik | Heuristics | Branch-and-Bound | Branch and Bound | Durchlaufzeit | Lead time | Operations Research | Operations research |
-
Massabo, Ivar, (2016)
-
Ozturk, Onur, (2017)
-
Throughput optimization in two-machine flowshops with flexible operations
Crama, Yves, (2010)
- More ...
-
Data correcting algorithms in combinatorial optimization
Goldengorin, Boris, (2002)
-
Chistyakov, Vyacheslav, (2012)
-
An exact model for cell formation in group technology
Krushinsky, Dmitry, (2012)
- More ...