摘要
讨论了形如Pm|res sh,pj=1|Cmax离散型多资源排序问题,这一问题等价于一类整数规划问题,给出了一个求解基本向量的分枝定界算法。
This thesis discusses the discrete multi-scheduling resources problem with the form of Pm Ires sh,pj = 1 |C which is equivalent to a class of integer programming problem, it gives a solution to branch and bound algorithm of basic vector.
出处
《长春大学学报》
2009年第12期7-9,共3页
Journal of Changchun University
关键词
排序
最优资源分配
资源约束
算法复杂性
整数规划
sorting
optimal resource allocation
resource constraint
complexity of algorithm
integer programming