On the configuration-LP for scheduling on unrelated machines
Year of publication: |
2014
|
---|---|
Authors: | Verschae, José ; Wiese, Andreas |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 17.2014, 4, p. 371-383
|
Subject: | Machine scheduling | Integrality gap | Configuration-LP | Approximation algorithms | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Produktionssteuerung | Production control | Künstliche Intelligenz | Artificial intelligence |
-
Minimization of maximum lateness on parallel machines with a single server and job release dates
Elidrissi, Abdelhak, (2024)
-
Bicriteria two-machine flowshop scheduling : approximation algorithms and their limits
Jiang, Xiaojuan, (2024)
-
Preemptive scheduling of parallel jobs of two sizes with controllable processing times
Shioura, Akiyoshi, (2024)
- More ...
-
Optimal algorithms for scheduling under time-of-use tariffs
Chen, Lin, (2021)
-
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Correa, José R., (2012)
-
The power of preemption on unrelated machines and applications to scheduling orders
Correa, José R., (2012)
- More ...