Name
Abstract | ||
|---|---|---|
•Two-machine ow shop scheduling to maximize total early work is considered.•A dynamic programming approach running in O(n2d2) time is proposed.•A fully polynomial time approximation scheme (FPTAS) is developed.•The approximation results work for the weighted model - if a specific constraint is satisfied. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.ejor.2021.07.055 | European Journal of Operational Research |
Keywords | DocType | Volume |
Combinatorial optimization,Flow shop scheduling,Early and late work,Dynamic programming,FPTAS | Journal | 300 |
Issue | ISSN | Citations |
2 | 0377-2217 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chen Xin | 1 | 625 | 120.92 |
| Qian Miao | 2 | 0 | 0.34 |
| Bertrand M. T. Lin | 3 | 0 | 0.34 |
| Malgorzata Sterna | 4 | 0 | 0.34 |
| Jacek Blazewicz | 5 | 1064 | 154.23 |