Scheduling resumable deteriorating jobs on a single machine with non-availability constraints

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

A survey of scheduling with deterministic machine availability constraints

Ying Ma, Chengbin Chu, Chunrong Zuo · Computers & Industrial Engineering · 2009 · 404 citations

Management, Operations Management, Systems Engineering +12

Scheduling jobs under simple linear deterioration

Gur Mosheiov · Computers & Operations Research · 1994 · 300 citations

Management, Industrial Engineering, Operations Management +12

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