| 一类二阶段指派问题 |
| |
| 引用本文： | 林浩,林澜. 一类二阶段指派问题[J]. 运筹与管理, 2021, 30(2): 97-101. DOI: 10.12005/orms.2021.0047 |
| |
| 作者姓名： | 林浩 林澜 |
| |
| 作者单位： | 1.河南工业大学 理学院,河南 郑州 450001;2.同济大学 电子与信息工程学院,上海 200092 |
| |
| 基金项目： | 国家自然科学基金资助项目(11571323,61373106) |
| |
| 摘 要： | 经典的指派问题是研究资源与任务的二元匹配。作为推广,三维指派问题是研究资源、任务与作业的三元匹配。前者已有成熟的有效算法,后者是著名的NP困难问题。本文讨论介于二者之间的一类二阶段指派问题,即可分解为二阶段决策的特殊三维匹配问题,给出多项式时间算法。
|
| 关 键 词： | 组合最优化 指派问题 二阶段指派问题 特殊三维匹配 |
| 收稿时间： | 2013-12-02 |
A Type of Two-stage Assignment Problem |
| |
| LIN Hao,LIN Lan. A Type of Two-stage Assignment Problem[J]. Operations Research and Management Science, 2021, 30(2): 97-101. DOI: 10.12005/orms.2021.0047 |
| |
| Authors: | LIN Hao LIN Lan |
| |
| Affiliation: | 1. School of Science, Henan University of Technology, Zhengzhou 450001, China;2. School of Electronics and Information Engineering, Tongji University, Shanghai 200092, China |
| |
| Abstract: | The classical assignment problem studies the binary matchings between the resources and tasks. As a generalization, the 3-dimensional assignment problem studies the triple matchings between the resources, tasks, and services. The former is well solved by efficient algorithms, while the latter is a well-known NP-hard problem. This paper discusses a two-stage assignment problem between these two levels, which is a special 3-dimensional assignment problem that can be decomposed into two-stage decision. Several polynomial-time algorithms are presented. |
| |
| Keywords: | combinatorial optimization assignment problem two-stage assignment problem special 3-dimensional matching |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《运筹与管理》浏览原始摘要信息 |
|
点击此处可从《运筹与管理》下载全文 |
|
