...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Discrete Applied Mathematics >A direct barter model for course add/drop process
【24h】

A direct barter model for course add/drop process

机译：用于课程添加/删除过程的直接易货模型

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Even though course timetabling and student scheduling problems have been studied extensively, not much has been done for the optimization of student add/drop requests after the initial registration period. Add/drop registrations are usually processed with a first come first served policy. This, however, can introduce inefficiencies and dead-locks resulting in add/drop requests that are not satisfied even though they can, in fact, be satisfied. We model the course add/drop process as a direct bartering problem in which add/drop requests appear as bids. We formulate the resulting problem as an integer linear program. We show that our problem can be solved polynomially as a minimum cost flow network problem. In our model, we also introduce a two-level weighting system that enables students to express priorities among their requests. We demonstrate improvement in the satisfaction of students over the currently used model and also the fast performance of our algorithms on various test cases based on real-life registration data of our university.
机译：尽管已经对课程时间表和学生日程安排问题进行了广泛的研究，但是在初始注册期之后，对于优化学生添加/删除请求的工作还很少。通常使用先到先得的策略处理添加/删除注册。但是，这可能会导致效率低下和死锁，即使实际上可以满足添加/删除请求，也无法满足他们的要求。我们将课程添加/删除过程建模为直接的易货问题，其中添加/删除请求显示为出价。我们将产生的问题公式化为整数线性程序。我们表明，我们的问题可以作为最小成本流网络问题多项式解决。在我们的模型中，我们还引入了两级加权系统，使学生能够表达他们的要求中的优先级。我们证明了学生对当前使用模型的满意度得到了改善，并且基于我们大学的真实注册数据，我们的算法在各种测试案例上的快速性能也得到了提高。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号