Name
Abstract | ||
|---|---|---|
We consider the online scheduling of two machines under a grade of service (GoS) provision and its semi-online variant where the total processing time is known. Respectively for the online and semi-online problems, we develop algorithms with competitive ratios of 53 and 32 which are shown to be optimal. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.orl.2005.11.004 | Oper. Res. Lett. |
Keywords | Field | DocType |
competitive ratio,grade of service,semi-online variant,two machines,online,semi-online,online scheduling,service provision,total processing time,semi-online scheduling,semi-online problem | Online algorithm,Mathematical optimization,Service provision,Grading (education),Industrial engineering,Scheduling (computing),Computer science,Grade of service,Distributed computing | Journal |
Volume | Issue | ISSN |
34 | 6 | Operations Research Letters |
Citations | PageRank | References |
40 | 2.20 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jongho Park | 1 | 130 | 16.29 |
| Soo Y. Chang | 2 | 157 | 12.21 |
| Kangbok Lee | 3 | 292 | 21.17 |