活动安排问题的算法研究

Algorithm Study of the Activity Selection Problem

面对资源的日益紧缺,研究如何高效地安排一系列争用某一公共资源的活动和如何使用最少的资源安排全部活动具有很高的现实意义。本文利用贪心策略,给出了求解两个活动安排问题算法的详细设计和代码,并用实例验证了算法的有效性,为资源组合规划问题的探索研究提供了有效的途径。

With increasingly scarce resources,how to arrange for a series of activities efficiently to scramble for a public resources,how to use the minimal resources to arrange all the activities have the implementation of high significance.In this paper,we use the greedy method,give the detailed design and code of the algorithm for the activity selection problem,and use example to verify the effectiveness of the algorithm.The algorithm will provide an effective way to exploration and study of resource portfolio planning problem.