| 求解排课表问题的一个启发式数值算法 |
| |
| 引用本文： | 谢凡荣.求解排课表问题的一个启发式数值算法[J].运筹与管理,2005,14(5):36-40. |
| |
| 作者姓名： | 谢凡荣 |
| |
| 作者单位： | 南昌大学,数学系,江西南昌330047 |
| |
| 摘 要： | 为了便于建立与排课表问题有关的决策支持系统,本文给出一个求解排课表问题的启发式数值算法,证明了算法的正确性,并举例说明算法的应用.该算法具有易于编程实现、收敛性好等优点,大量数值实值表明该算法能求得问题的最优解.
|
| 关 键 词： | 运筹学 决策支持系统 数值实验 排课表问题 典则型运输网络 最小费用最大流 |
| 文章编号： | 1007-3221(2005)05-0036-05 |
| 收稿时间： | 11 13 2004 12:00AM |
| 修稿时间： | 2004年11月13 |
A Heuristic Numerical Algorithm for Solving the Problem of Curriculum Scheduling |
| |
| XIE Fan-rong.A Heuristic Numerical Algorithm for Solving the Problem of Curriculum Scheduling[J].Operations Research and Management Science,2005,14(5):36-40. |
| |
| Authors: | XIE Fan-rong |
| |
| Institution: | Department of Mathematics, Nanchang University, Nanchang 330047, China |
| |
| Abstract: | For the convenience to build decision- making supporting system related to the problem of curriculum scheduling, a heuristic numerical algorithm is presented for solving the problem of curriculum scheduling. The theory , on which the algorithm depends on, is strictly proved. An example is given to demonstrate the use of the algorithm. The algorithm has the merits to be programmed easily and of good convergence, and many numerical experiments have verified that the algorithm can find the optimal solution to the problem of curriculum scheduling. |
| |
| Keywords: | operations research decision-making supporting system numerical experiment the problem ofcurriculum scheduling the standard transportation network the minimum cost maximum flow |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
