An Investigation of Single-Machine Due-Window Assignment with Time-Dependent Processing Times and a Controllable Rate-Modifying Activity

Abstract

In this study, a single-machine scheduling and due-window assignment problem is addressed. In the proposed model, the job processing time is assumed a linear function of its starting time and all the n job-independent deterioration rates are the same. In addition, an option is considered for performing a rate-modifying activity for changing the normal processing times of the jobs following this activity. The duration of the maintenance is assumed deteriorating and controllable. The objective is to schedule the jobs, the due window, the rate-modifying activity and the amount of additional resource allocated to it for minimizing the sum of earliness, tardiness, due-window-related costs and resource-related costs. We build several properties and then give a polynomial solution for problem under consideration.