Integer preemptive scheduling on parallel machines
Year of publication: |
2012
|
---|---|
Authors: | Baptiste, Philippe ; Carlier, J. ; Kononov, Alexander ; Queyranne, Maurice ; Sevastyanov, Sergey |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 40.2012, 6, p. 440-444
|
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
Han, Hee-jong, (2013)
-
Azizoglu, Meral, (2015)
-
A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem
Hifi, Mhand, (2023)
- More ...
-
Efficient approximation algorithms for the routing open shop problem
Chernykh, Ilya, (2013)
-
A complete 4-parametric complexity classification of short shop scheduling problems
Kononov, Alexander, (2012)
-
An exact solution with an improved running time for the routing flow shop problem with two machines
Chernykh, Ilya, (2024)
- More ...