Title
Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
Abstract
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.
Year
DOI
Venue
2011
10.1016/j.amc.2011.03.010
Applied Mathematics and Computation
Keywords
Field
DocType
Scheduling,Parallel machine,Maintenance activity,Polynomial algorithm
Mathematical optimization,Machine scheduling,Polynomial,Scheduling (computing),Polynomial algorithm,Numerical analysis,Decision-making,Mathematics,Penalty method
Journal
Volume
Issue
ISSN
217
20
0096-3003
Citations 
PageRank 
References 
19
0.69
19
Authors
2
Name
Order
Citations
PageRank
Jibo Wang174541.50
Cai-Min Wei2272.20