Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity

• We consider single-machine due-window assignment and scheduling problem.
• We consider three factors: resource allocation, aging effect, and a RMA.
• We complete the cases of the start and finish time of the due-window.
• Polynomial time optimal algorithms are proposed for each model.

We consider single-machine scheduling with a common due-window and a deteriorating rate-modifying activity. We assume that the processing time of a job is a function of the amount of a resource allocated to it, its position in the processing sequence, and its aging effect. The objective is to minimize the total cost, which is a function of earliness, tardiness, due-window starting time, due-window size, and resource consumption. We consider two models of the job processing time function and provide polynomial-time solution algorithms for the corresponding problems. We also give a more efficient solution algorithm for a special case of the second problem.