Parallel-Machine Scheduling with Delivery Times and Deteriorating Maintenance

Abstract

In this paper, we consider parallel-machine scheduling with past-sequence-dependent (p-s-d) delivery times and deteriorating maintenance. The delivery time of a job is proportional to its waiting time in the system. Each machine has a deteriorating maintenance activity, i.e., delaying the maintenance increases the time required to perform it. We consider three versions of the problem to minimize the total absolute deviation of job completion times, the total load on all the machines, and the total completion time. We develop polynomial-time algorithms to solve them.