摘要
本文讨论有资源约束的Q/res/Cmax问题的启发式算法,利用“首先空闲”准则的一个性质,给出了种重新分配的改进型算法.
This paper discusses the Q/res/Cmax problem with resource constrains. By takingadvantage of property of the 'First Idle' rule, we give an improvement-type algorithm forit by the reassign method.
出处
《运筹学学报》
CSCD
1997年第2期69-75,共7页
Operations Research Transactions