摘要
给出与研究1 rj=bj-ajuj,∑uj U-∑uj+Cm ax型资源分配与排序问题.对于系统中加工顺序确定的情况给出并证明一个寻求其最优资源分配的多项式算法;就系统参量的某些特殊情况研究系统的最优排序.
In this paper, we put forward and discuss the following resource constrained scheduling systems 1｜rj=bj-ajuj,∑uj≤U｜∑uj＋Cmax Under the situation of a finite task permutation with the system, one algorithms for exploring optimal resource allocation is given and proven; and on some special conditions such as aj= a,pj = p ^-u = ^-u, the study of optimal schedules with the system is made.
出处
《数学的实践与认识》
CSCD
北大核心
2006年第1期62-69,共8页
Mathematics in Practice and Theory
