Name
Title | ||
|---|---|---|
Study On Proportionate Flowshop Scheduling With Due-Date Assignment And Position-Dependent Weights |
Abstract | ||
|---|---|---|
In a recent paper, Jiang et al. (EngOptim 52(1):37-52, 2020) considered proportionate flowshop scheduling with position-dependent weights. For common and slack due-date assignment problems, they proved that both of these two problems can be solved in O(n(2) log n) time, where n is the number of jobs. The contribution of this paper is that we show that these two problems can be optimally solved by a lower-order algorithm, i.e., in O(n log n) time. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s11590-020-01670-4 | OPTIMIZATION LETTERS |
Keywords | DocType | Volume |
Scheduling, Proportionate flowshop, Due-date assignment, Optimal solution algorithm, Algorithm complexity | Journal | 15 |
Issue | ISSN | Citations |
6 | 1862-4472 | 1 |
PageRank | References | Authors |
0.36 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan-Yang Lv | 1 | 1 | 0.36 |
| Jibo Wang | 2 | 745 | 41.50 |