Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
作者:
Highlights:
•
摘要
In this paper we consider identical parallel machines scheduling problems with a deteriorating maintenance activity. In this model, each machine has a deteriorating maintenance activity, that is, delaying the maintenance increases the time required to perform it. We need to make a decision on when to schedule the rate-modifying activities and the sequence of jobs to minimize some objective function. We concentrate on two goals separately, namely, minimizing the total absolute differences in completion times (TADC) and the total absolute differences in waiting times (TADW). We show that the problems remain polynomially solvable under the proposed model.
论文关键词:Scheduling,Parallel machine,Maintenance activity,Polynomial algorithm
论文评审过程:Available online 9 March 2011.
论文官网地址:https://doi.org/10.1016/j.amc.2011.03.010