| N×2N瓶颈指派问题及其阀门(threshold)算法 |
| |
| 引用本文： | 闻振卫.N×2N瓶颈指派问题及其阀门(threshold)算法[J].数学的实践与认识,2008,38(2):53-58. |
| |
| 作者姓名： | 闻振卫 |
| |
| 作者单位： | 苏州大学,数学科学学院,江苏,苏州,215006 |
| |
| 摘 要： | 讨论把2N项任务(或工件)指派(安排)给N个人(或机器)的问题.已知人i处理(或加工)任务j的时间花费是cij,i=1,2,…,N,j=1,2,…,2N,要求每人恰承担2项任务,每项任务恰由1个人承担.怎样分派任务,使完成任务最慢的人所花的时间最少.
|
| 关 键 词： | 运筹学 指派问题 瓶颈指派问题 排序 生产管理 |
| 修稿时间： | 2005年3月8日 |
N×2N Bottleneck Assignment Problems with the Threshold Algorithm |
| |
| WEN Zhen-wei.N×2N Bottleneck Assignment Problems with the Threshold Algorithm[J].Mathematics in Practice and Theory,2008,38(2):53-58. |
| |
| Authors: | WEN Zhen-wei |
| |
| Abstract: | Consider a set of 2N jobs and a group of N persons(or machines) with processing time(or cost) cijif person i is assigned job j.Each person is required to be assigned exactly 2 jobs and each job is assigned to exactly one person.The objective function is the largest total processing time of any person.The problem is to assign the 2N jobs to N persons in such a way that the objective value is minimized. |
| |
| Keywords: | operations research assignment problem bottleneck assignment problem scheduling production management |
| 本文献已被 万方数据 等数据库收录！ |
|
