摘要
研究具有加工时间之和学习效应下的一个新型成组排序问题,工件的学习效应是之前工件加工时间之和的函数,组学习效应是成组加工所在的位置的函数.考虑最大完工时间和总完工时间两个问题,证明了这两个问题都是多项式时间可解的,并提出了相应的多项式时间算法.
This paper investigates a new group scheduling problem with sum-ofprocessing-time based learning effect. The learning effect of a job is assumed to be a function of total processing times of jobs scheduled in front of it, the learning effect of group is assumed to a function of its position in the sequence. The goal is to minimize makespan and the total completion times under the proposed model, respectively. Some optimal properties and optimal polynomial time algorithms to solve these problems are also provided.
出处
《运筹学学报》
CSCD
北大核心
2013年第1期98-105,共8页
Operations Research Transactions
基金
Supported by the DFCQNU(Nos.11XLB027,2011XLZ05)
the Foundation of Chongqing Education Commission(Nos.KJ120624,KJ110614)
the Tianyuan Fund for Mathematics(No.11226237)
关键词
单机排序
学习效应
成组技术
时间表长
总完工时间
single-machine, learning effect, group technology, makespan, total completion time
