Name
Abstract | ||
|---|---|---|
•We study the online fractional hierarchical scheduling problem on uniformly related machines.•We present some sophisticated lower bounds and an online algorithm framework.•The algorithm is proved optimal for the problem with no more than four hierarchies.•Computational tests show that the algorithm works well in all cases. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.cor.2019.104778 | Computers & Operations Research |
Keywords | Field | DocType |
Online algorithm,Fractional scheduling,Hierarchical scheduling,Uniformly related machines | Online algorithm,Mathematical optimization,Job shop scheduling,Scheduling (computing),If and only if,Hierarchy,Mathematics | Journal |
Volume | ISSN | Citations |
113 | 0305-0548 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhaohui Liu | 1 | 36 | 4.45 |
| Jiyuan Zhan | 2 | 0 | 0.34 |