Name
Title | ||
|---|---|---|
Online single-machine scheduling to minimize the linear combination of makespans of two agents |
Abstract | ||
|---|---|---|
•An online two-agent single-machine scheduling problem is considered.•An approximation algorithm is developed.•The competitive ratio of the approximation algorithm is analyzed.•The competitive ratio is better than that obtained by Ding and Sun (2010).•The analysis of the competitive ratio is tight. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.ipl.2021.106163 | Information Processing Letters |
Keywords | DocType | Volume |
Scheduling,Two-agent,Release dates,Online algorithm,Competitive ratio | Journal | 173 |
ISSN | Citations | PageRank |
0020-0190 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiwen Lu | 1 | 182 | 21.03 |
| Kejun Zhao | 2 | 17 | 2.02 |
| Manzhan Gu | 3 | 36 | 4.99 |