考虑了指派问题:有m项工作和n个人
若m与n是相同的,并且每一项工作只能由一个人来做;同时,每一个人只能做一项工作;符合这一条件的指派问题称为标准指派问题;若m与n不相同,则称为非标准指派问题
本文在充分考虑了指派问题性质的基础上,建立了求解标准指派问题的动态规划模型,并给出了其求解算法;
最后,通过实例说明了本文提出的方法的基本步骤和计算方法的可靠性
关键词： Hopfield网络
） 摘要： 在日常生活和企业生产经营管理工作中,经常面临着给人“分派”工作任务的问题,由于每个人的专长不同,因此,每个人完成同一项工作任务的效率(或所需时间、费用)也不相同
因此,就产生了应如何指派哪个人去完成何任务,从而使完成任务的总效率最大或所需时间和费用最少的问题
） Abstract： In their daily lives and production and operations management, often faced with giving the“assigned”work of the task, due to different expertise of each individual, each with a task to complete the efficiency (or the time required at a cost) Is not the same
Therefore, the question arises as to how to assign any person to complete what tasks, so that the total completion of the mission or the time required for maximum efficiency and minimum cost
Assigned to consider the question: there are m and n individual items
If m and n are the same, and each can only be done by one person; At the same time, everyone can do a job; in line with the conditions Assigned to the issue of standards known as the assignment problem; if m and n are different, then known as non-standard assignment problem
In this paper, take full account of the nature of the assignment problem on the basis of established standards to solve the problem assigned to the dynamic programming model, and gives its algorithm;
Finally, an example of this paper describes the basic steps of the method of calculation and reliable Sex Keywords： Hopfield network; neural network; assignment problem; Optimization 下载PDF阅读器 PDF全文下载： 初稿 （ 144 ） 作者简介： 通信联系人： 【收录情况】 中国科技论文在线： 王黎明
Hopfield网络在指派问题中的应用[EB/OL]
北京：中国科技论文在线
总览 评价 王黎明 * （ 辽宁工程技术大学理学院信息与计算科学系
优化计算 Wang Liming * （ Liaoning Engineering Technology University College of Information and Computing Science
