Scheduling a variable maintenance and linear deteriorating jobs on a single machine
We consider a scheduling model with a variable maintenance on a single machine. The job processing time is general linear deteriorating. Minimizing makespan and total completion time are proved to be NP-hard respectively. An FPTAS is given for the objective of minimizing makespan.
scheduling maintenance deteriorating jobs computational complexity