Single-machine scheduling problems simultaneous with deteriorating and learning effects under a deteriorating maintenance consideration

Abstract

Machine scheduling problems in just-in-time production environments are important issues in modern operations management to satisfy customer demand for superior service. In this paper we investigate single-machine scheduling problems with simultaneous considerations of the effects of deterioration and learning. Due to the deteriorating effect, maintenance may be performed on the machine to improve its production efficiency. We assume that at most one maintenance is allowed throughout the scheduling horizon. We further assume that the maintenance duration depends on its starting time. Our goal is to find jointly the optimal time to perform the maintenance, the optimal location of the due-window, and the optimal job sequence such that the total cost that includes earliness, tardiness, and duewindow size and location penalties is minimized. We also aim to investigate the makespan, the total completion time, and the total absolute deviation of completion times minimization problems. We propose polynomial time algorithms for all the studied problems.