摘要
讨论了工件加工时间依赖工件位置的链约束单机排序问题.对于链可中断和不可中断两种情形,证明了目标函数为最大完工时间和总完工时间时该问题仍然多项式时间可解.
In this paper, a single machine scheduling problem in which the job subjects to chains constrains and the job processing times are defined by functions dependent on their positions in the sequence. Under non-preemptive chains and preemptive chains, it is proved that makespan and total completion time problems remain polynomially solvable.
出处
《哈尔滨商业大学学报（自然科学版）》
CAS
2008年第5期596-599,共4页
Journal of Harbin University of Commerce：Natural Sciences Edition
关键词
排序
单机
学习效应
链约束
最大完工时间
scheduling
single machine
learning effect
chains constraints
total completion time
