Name
Title | ||
|---|---|---|
Exact and Heuristic Algorithms for Scheduling on Two Identical Machines with Early Work Maximization |
Abstract | ||
|---|---|---|
•LPT has an approximation ratio 109 for common due date version.•The lower bound of LPT’s approximation ratio can be proven to 1112.•A branch-and-bound algorithm is proposed for arbitrary due date version.•The performances of the proposed algorithms are tested by numerical experiments. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.cie.2020.106449 | Computers & Industrial Engineering |
Keywords | DocType | Volume |
Scheduling,Early work,Identical machines,Branch-and-bound algorithm,Heuristic algorithm | Journal | 144 |
ISSN | Citations | PageRank |
0360-8352 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chen Xin | 1 | 625 | 120.92 |
| Wen Wang | 2 | 0 | 0.34 |
| Pengyu Xie | 3 | 0 | 0.34 |
| Xingong Zhang | 4 | 0 | 0.34 |
| Małgorzata Sterna | 5 | 104 | 9.18 |
| Jacek Blazewicz | 6 | 1064 | 154.23 |