Complexity and approximability of scheduling resumable proportionally deteriorating jobs

The NP-completeness column: An ongoing guide

David S. Johnson · Journal of Algorithms · 1986 · 803 citations

Computing, Computer Science, Algorithms +9

A concise survey of scheduling with time-dependent processing times

T.C.E. Cheng, Qingqing Ding, Bertrand M.T. Lin · European Journal of Operational Research · 2003 · 636 citations · Full text

Computing, Computer Engineering, Computer Science +13

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Gerhard J. Woeginger · INFORMS journal on computing · 2000 · 232 citations

Natural Sciences, Computer Science, Mathematics +16

Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities

Suh‐Jenq Yang, Dar-Li Yang · Omega · 2010 · 143 citations

Management, Industrial Engineering, Operations Management +14

Scheduling linear deteriorating jobs with an availability constraint on a single machine

Min Ji, Yong He, T.C.E. Cheng · Theoretical Computer Science · 2006 · 84 citations

Management, Industrial Engineering, Operations Management +14