Two Due-Date Assignment Scheduling with Location-Dependent Weights and a Deteriorating Maintenance Activity

Abstract

This paper investigates single-machine scheduling with a deteriorating maintenance activity, where the processing time of a job depends on whether it is handled before or after the maintenance activity. Under common and slack due date assignments, the aim is to find the optimal job schedule, position of the maintenance activity, and optimal value of the common due date (flow-allowance) so that the linear weighted sum of earliness, tardiness and common due date (flow-allowance) value is minimized, where the weights are location-dependent (position-dependent) weights. Through a series of optimal properties, a polynomial time algorithm is proposed and it is then proven that the problem is polynomially solvable.

Keywords

• scheduling
• maintenance activity
• common due date
• common flow-allowance
• slack due date
• location-dependent weights