| 有负荷约束的指派问题 |
| |
| 引用本文： | 林 浩,林 澜. 有负荷约束的指派问题[J]. 经济数学, 2013, 30(1): 17-21 |
| |
| 作者姓名： | 林 浩 林 澜 |
| |
| 作者单位： | 1. 河南工业大学理学院,郑州,450052
2. 同济大学电子与信息工程学院,上海,200092 |
| |
| 摘 要： | 通过组合最优化的理论和方法,研究机器有负荷(时间)限制的指派问题,证明其NP困难性,并建立多项式可解的特殊情形算法及一般情形的隐枚举算法.
|
| 关 键 词： | 组合优化 指派问题 负荷约束 算法分析 |
An Assignment Problem with Work Load Constrains |
| |
| LIN Hao,LIN Lan. An Assignment Problem with Work Load Constrains[J]. Mathematics in Economics, 2013, 30(1): 17-21 |
| |
| Authors: | LIN Hao LIN Lan |
| |
| Affiliation: | 1.School of Science,HenanUniversity of Technology,Zhengzhou,Henan 450052,China; 2.School of Electronics and Information Engineering,Tongji University,Shanghai 200092,China) |
| |
| 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 |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《经济数学》浏览原始摘要信息 |
|
点击此处可从《经济数学》下载全文 |
|
