摘要
本文研究了一类加工时间依赖工件位置的成组排序问题。各工件的加工时间具有与位置有关的学习效应,同组工件必须连续加工且无等待时间,组间存在与顺序无关的安装时间,证明了目标函数为极小化最大完工时间和总完工时间是多项式可解的。
In the paper,we discuss a class of group scheduling with position-dependent processing time. The same group of jobs are processed continuously without waiting and the different groups have installation time that is nothing to do with the order.It is proved that makespan and total completion time problems is polynomial solvable.
出处
《科技传播》
2010年第10期19-19,21,共2页
Public Communication of Science & Technology
关键词
排序
单机
学习效应
成组排序
最大完工时间
总完工时间
scheduling
single machine
learning effect
Group Scheduling makespan
The total completion time
