Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties

被引:42
作者
Wang, Ji-Bo [1 ]
Wei, Cai-Min [2 ]
机构
[1] Shenyang Aerosp Univ, Sch Sci, Shenyang 110136, Peoples R China
[2] Shantou Univ, Dept Math, Shantou 515063, Peoples R China
基金
中国国家自然科学基金;
关键词
Scheduling; Parallel machine; Maintenance activity; Polynomial algorithm; DUE-DATE ASSIGNMENT; WAITING TIME; FLOW TIME; VARIANCE; MINIMIZATION; JOBS;
D O I
10.1016/j.amc.2011.03.010
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:8093 / 8099
页数:7
相关论文
共 37 条