Name
Title | ||
|---|---|---|
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date |
Abstract | ||
|---|---|---|
•Fully polynomial time approximation scheme for early work maximization is proposed.•The new FPTAS dominates PTAS for the two-machine case known from the literature.•Complexity of parallel machine scheduling problems with common due date is studied.•Theoretical studies are completed with computational experiments. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ejor.2019.12.003 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,Parallel identical machines,Early work,Late work,Fully polynomial time approximation scheme | Dynamic programming,Mathematical optimization,Job shop scheduling,Scheduling (computing),Mathematics,Polynomial-time approximation scheme,Computational complexity theory | Journal |
Volume | Issue | ISSN |
284 | 1 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chen Xin | 1 | 625 | 120.92 |
| Yage Liang | 2 | 0 | 0.34 |
| Małgorzata Sterna | 3 | 104 | 9.18 |
| Wen Wang | 4 | 0 | 0.34 |
| Jacek Blazewicz | 5 | 1064 | 154.23 |