节点文献

基于最小调整法求解最短时限指派问题

Using the least Adjustment Method to Solve the Assignment Problem of the Shortest Time Limit

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 夏少刚费威

【Author】 XIA Shao-gang,FEI Wei(Dongbei University of Finance and Economics,School of Mathematics and Quantitative Economics,Dalian 116025,China)

【机构】 东北财经大学数学与数量经济学院

【摘要】 最短时限指派问题是具有实际意义的一类指派问题,但是对于其解法的讨论大多根据传统算法思想,导致求解复杂.基于最小调整法思想,给出求解此类问题的简便方法,使求解简单有效,对算法有效性进行分析且给出算例予以验证,最后提出相关模型及其求解.

【Abstract】 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.

  • 【文献出处】 数学的实践与认识 ,Mathematics in Practice and Theory , 编辑部邮箱 ,2009年17期
  • 【分类号】O224
  • 【被引频次】12
  • 【下载频次】335
节点文献中: 

本文链接的文献网络图示:

本文的引文网络