Name
Abstract | ||
|---|---|---|
•Consider a rescheduling problem on a single machine in response to job delays.•Resource constrained where both the job rejection cost and the job tardiness are upperbounded.•Explore structural properties of some optimal reschedules and design a pseudo-polynomial time. exact algorithm•When the job rejection cost is unbounded, develop a fully polynomial time approximation scheme. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.cie.2020.106574 | Computers & Industrial Engineering |
Keywords | DocType | Volume |
Rescheduling,Job delay,Job rejection,Dynamic programming,Approximation scheme | Journal | 146 |
ISSN | Citations | PageRank |
0360-8352 | 1 | 0.35 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenchang Luo | 1 | 1 | 0.35 |
| Miaomiao Jin | 2 | 1 | 0.35 |
| Bing Su | 3 | 17 | 4.72 |
| Guohui Lin | 4 | 1301 | 107.34 |