首页> 外文会议>International Conference on Logistics, Engineering, Management and Computer Science >Research on Resource Scheduling Method Based on Improved Hungary Algorithm
【24h】

Research on Resource Scheduling Method Based on Improved Hungary Algorithm

机译:基于改进匈牙利算法的资源调度方法研究

获取原文

摘要

The optimal allocation of resources is of great significance to improve the efficiency and reduce the cost of equipment manufacturing. For the shortage of traditional Hungary algorithm that cannot solve the resource scheduling problem containing the parallel jobs, an improved Hungary algorithm is proposed in this paper. The improved algorithm converts the problem to a typical assignment problem by replacing parallel link with virtual job. And then, optimizing it with classical Hungary algorithm and determining the realizability of the virtual job based on the result. Finally, the optimal scheme will be got through iterative searching. In addition, an example of resources allocation optimizing of an equipment manufacturing system is introduced to verify the effectiveness of the proposed algorithm.
机译:资源的最佳分配是提高效率的重要意义,降低设备制造成本。 对于无法解决包含并行作业的资源调度问题的传统匈牙利算法的短缺,本文提出了一种改进的匈牙利算法。 通过用虚拟作业替换并行链路,改进的算法将问题转换为典型分配问题。 然后,用经典的匈牙利算法优化它并基于结果确定虚拟作业的可实现性。 最后,通过迭代搜索将获得最佳方案。 此外,还引入了一种资源分配优化设备制造系统的示例,以验证所提出的算法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号