| 有负荷约束的指派问题 |
 点此下载全文 |
| 引用本文：林 浩1,林 澜2.有负荷约束的指派问题[J].经济数学,2013,(1):17-21 |
| 摘要点击次数: 1635 |
| 全文下载次数: 163 |
|
|
| 中文摘要:通过组合最优化的理论和方法，研究机器有负荷（时间）限制的指派问题，证明其NP-困难性，并建立多项式可解的特殊情形算法及一般情形的隐枚举算法． |
| 中文关键词:组合优化 指派问题 负荷约束 算法分析 |
| |
| An Assignment Problem with Work Load Constrains |
|
|
| Abstract:This paper studied an assignment problem in which each facility has a work-load constraint by means of the method of combinatorial optimization. We proved the NP-hardness of the problem and presented a polynomial algorithm for a special case and an implicit enumeration algorithm for the general case. |
| keywords:combinatorial optimization assignment problem work-load constraint algorithmic analysis |
| 查看全文 查看/发表评论 下载pdf阅读器 |
