Name
Abstract | ||
|---|---|---|
An original online problem named the work-break problem is proposed to optimize the work hours of casual workers. The algorithm for our problem has to answer for a casual worker about when he should have a break for his efficiency declines with the growing duration of current work period. We consider the online uncertainty of the work efficiency and present a periodic algorithm for the problem. Then our algorithm is proved to be 2-competitive by a novel form of competitive analysis. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10878-018-0263-0 | J. Comb. Optim. |
Keywords | Field | DocType |
Work hour optimization,Work-break problem,Online algorithm,Competitive analysis,68W27,68Q25 | Online algorithm,Mathematical optimization,Casual,Periodic graph (geometry),Mathematics,Competitive analysis | Journal |
Volume | Issue | ISSN |
35 | 4 | 1382-6905 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weimin Ma | 1 | 427 | 26.76 |
| Wei Shao | 2 | 14 | 8.04 |
| Xiaodong Ji | 3 | 137 | 17.93 |