摘要
讨论机器带故障中断的两台平行机排序问题,工件加工时间均为单位时间,目标是极小化带权误工工件数.当转移时间t=0时给出了最优的算法.当t≠0时,给出了一个多项式时间的近似算法,并证明算法解与最优解至多相差一个带权误工数.
The problem of two parallel machines scheduling with machine disruptions is discussed. It is assumed that each job is of unit-length.The goal is to minimize the weighted number of tardy jobs. For the case when the transfer time t = 0,an optimal algorithm is presented.Base on this algorithm, an approximation algorithm for the case when t≠0 is proposed.It is proved that the weighted number of tardy jobs of the latter algorithm is at most one more than that of the optimal solution.
出处
《高校应用数学学报（A辑）》
CSCD
北大核心
2010年第4期393-395,共3页
Applied Mathematics A Journal of Chinese Universities(Ser.A)
基金
国家自然科学基金(11001242
11071220)
浙江省自然科学基金(Y6090554
Y6090175)
关键词
排序算法
机器故障
带权误工数
scheduling algorithm
machine disruption
weighted number of tardy jobs
