| 摘要: |
| 人员配置日程安排问题可以分为两部分来研究,即条件的表示和匹配。在这篇文章中,只讨论如何进行匹配而不论及条件表示。作者给出一个匹配算法,并且证明了根据这个算法可以得到条件最佳解。从而我们就可以把人员配置日程安排问题转化为排序处理问题。换言之,如果人员和部门可以排序处理,那么我们就可以得到最佳匹配结果。 |
| 关键词: 日程安排 算法 |
| DOI： |
| 投稿时间：1995-03-16 |
| 基金项目: |
|
| Study on the Algorithm of Staff Scheduling |
|
Lan Hongxing
|
| (Computing centre of Guangxi, Nanning, 530022) |
| Abstract: |
| Staff scheduling can be thought as a problem of matching staff with division. The expression of conditions of staff may be important. Even so, it is convenient to study by dividing the problem into two parts, matching and expression. In this article we discussed the matching and noninvolvement in expression. We advanced an algorithm of scheduling for staff and proved that the conditional best result of matching could be got in it. Thus the prob lem of scheduling for staff can be changed into ordinary sorting processing. If staff and divisions can be sorted we can get the best of matching result. |
| Key words: Scheduling Algorithm |
