Single-machine scheduling with time-dependent deteriorating and job-dependent learning effects under a deteriorating maintenance activity

We study a single-machine scheduling problem where the processing times of jobs simultaneously have the time-dependent deteriorating and the job-dependent learning effects under a deteriorating machine maintenance consideration. We consider four different performance measures. For the first three problems with the objectives of minimizing the makespan, minimizing the total completion time and minimizing the total absolute differences in completion times, we develop three polynomial algorithms to solve each of them. More efficient algorithms are designed to solve their special cases. For the problem with objective of minimizing the sum of earliness, tardiness, due-window starting time, and due-window size costs, we propose two optimal properties which enable us to develop a polynomial algorithm to solve it. We also consider three special cases of this problem, and more efficient algorithms are developed.