摘要
考虑时间和位置相关的单机排序问题,且机器具有退化的维修限制.工件的实际加工时间是工件加工位置相关的函数,目标函数为最大完工时间和总完工时间两个函数,并利用匹配算法给出这两个问题的多项式时间算法.最后得出工件满足一定条件时最大完工时间满足组平衡规则.
In this paper, we consider combining time and position dependent effects on a single machine subject to deteriorating maintenance activities. The actual process- ing time of the job is a function of its position. We focus on minimizing two classical objectives： the makespan and the sum of the completion times. The proposed two prob- lems can be solved in polynomial time by using the matching algorithm. Finally, the makespan problems can be solved by the group balance principle under some certain conditions.
出处
《运筹学学报》
CSCD
北大核心
2016年第3期33-44,共12页
Operations Research Transactions
基金
国家自然科学基金(Nos.11401065
11571321)
重庆市教委基金(No.KJ130606)
重庆市自然科学基金(No.cstc2014jcyjA00003)
关键词
排序
时间与位置相关
维修活动
匹配算法
组平衡规则
scheduling, time-dependent and position-dependent, maintenance activ-ities, matching algorithm, the group balance principle
