摘要
讨论了工件的加工时间是开工时间的线性递减函数、工件之间有平行链约束的单机排序问题.对于链可中断和不可中断两种情况,给出了极小化总完工时间的最优算法.
A group scheduling problem in which the job subject to chains constraints and processing time is a linear decreasing function of starting time was discussed. Under discontinuous chains and continuous chains,a polynomial algorithm of total completion time is given.
出处
《兰州工业高等专科学校学报》
2010年第3期16-18,共3页
Journal of Lanzhou Higher Polytechnical College
关键词
单机
排序
链约束
总完工时间
最优算法
single machine
scheduling
chains constraints
total completion time
optimal algorithm
