Name
Abstract | ||
|---|---|---|
•Detailed picture of computational tractability for the scheduling problems at hand.•Efficient algorithms for tractable problems.•A fully polynomial-time approximation scheme for an intractable problem. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ejor.2018.11.002 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,Time-of-use cost,Computational complexity,Efficient algorithm,Polynomial-time approximation scheme | Mathematical optimization,Time of use,Scheduling (computing),Total cost,Mathematics | Journal |
Volume | Issue | ISSN |
274 | 3 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bo Chen | 1 | 207 | 19.49 |
| Xiandong Zhang | 2 | 8 | 2.27 |