Pseudo lower bounds for online parallel machine scheduling
Year of publication: |
2015
|
---|---|
Authors: | Tan, Zhiyi ; Li, Rongqi |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 5, p. 489-494
|
Subject: | Scheduling | Online | Competitive ratio | Lower bound | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Produktionssteuerung | Production control | Mathematische Optimierung | Mathematical programming |
-
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
Liu, Peihai, (2014)
-
Ozturk, Onur, (2017)
-
Applying "Peeling Onion" approach for competitive analysis in online scheduling with rejection
Ma, Ran, (2021)
- More ...
-
Mixed coordination mechanisms for scheduling games on hierarchical machines
Chen, Qianqian, (2018)
-
Coordination mechanisms for scheduling games with machine modification
He, Chaoyu, (2020)
-
Scheduling to minimize the maximum total completion time per machine
Wan, Long, (2015)
- More ...