Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect

Abstract

In this paper, we study the single-machine scheduling problems with DeJong’s learning effect and deteriorating maintenance activity, where DeJong’s learning effect is a special position-based learning effect and the duration of the deteriorating maintenance activity is a linear increasing function of its starting time. Our goal is to determine the job sequence of all jobs and the position of the maintenance activity to minimize some performance measures. When the performance measures are the makespan and the total completion time, we show that both of them can be solved in polynomial time. When the performance measure is the total weighted completion time, we develop a pseudo-polynomial time dynamic programming algorithm under a special case. When the performance measure is the maximum lateness, we show that the earliest due date first (EDD) order is a bad algorithm for the general case, and develop a polynomial time algorithm under a special case.