Slack Due-Window Assignment Scheduling Problem with Deterioration Effects and a Deteriorating Maintenance Activity

Abstract

This paper studies the slack due-window assignment scheduling problem with deterioration effects and a deterioration maintenance activity on a single-machine. The machine deteriorates during the machining process, and at a certain moment performs a deterioration maintenance activity, that is, the duration time of the maintenance activity is a linear function of the maintenance starting time. It is needed to make a decision on when to schedule the deteriorating maintenance activity, the optimal common flow allowances and the sequence of jobs to minimize the weighted penalties for the sum of earliness and tardiness, weighted number of early and delayed, and weighted due-window starting time and size. This paper proposes a polynomial time algorithm to solve this problem.

Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization

“…They also showed that some special cases of the problem are polynomially solvable. Jia et al [24] and Sun et al [25] considered single machine scheduling with deteriorating jobs and a maintenance activity. Miao et al [26] investigated single machine scheduling with deteriorating jobs and delivery times.…”

Delivery Times Scheduling with Deterioration Effects in Due Window Assignment Environments

“…For the three versions of scheduling cost and resource consumption cost, they proved that the problem can be solved in polynomial time. Jia et al [17] discussed the combination of the SLKDW and deterioration effects. Lv and Wang [18] researched the two-machine flowshop scheduling with the DIFDW and resource allocation.…”