摘要
最短时限指派问题是具有实际意义的一类指派问题,但是对于其解法的讨论大多根据传统算法思想,导致求解复杂.基于最小调整法思想,给出求解此类问题的简便方法,使求解简单有效,对算法有效性进行分析且给出算例予以验证,最后提出相关模型及其求解.
The assignment problem of the shortest time limit is of importance. But the discussions about its solution are on the basis of the traditional algorithms thoughts so that it leads to the complexity of its solution. This paper gives the simple solution basing on the least adjustment method, and it makes solve the problem easy and effective. And this paper analyses the validity of the algorithm, gives examples to test, at last gives the correlative model and its solution.
出处
《数学的实践与认识》
CSCD
北大核心
2009年第17期179-187,共9页
Mathematics in Practice and Theory
关键词
运筹学
指派问题
最短时限
最小调整法
operational research
assignment problem
the shortest time limit
the least adjustment method