Scheduling Meetings in Distance Learning

摘要：

Peer-to-peer technique becomes mature gradually, and multiple domain-involved applications emerge, such as IPTV, distance learning, chatting network. In the context of distance learning, small scale of teachers would serve large scale of geographically located students. Normally, knowledge points are associated with different difficulty levels. And students usually are interested in varied subsets of knowledge points. Also teachers are capable of serving knowledge point subsets. The objective to schedule meeting among students and teachers according to their respective interests and capabilities is to reduce total learning duration. After formulating meeting schedule as Integer Programming problem, this paper proposes three heuristic algorithms to approximate the optimal solution. To the best of our knowledge, such problem is firstly investigated in distance learning context. Performance evaluation demonstrates their behaviors and PKPA algorithm excels two others substantially.

关键词： Scheduling Timetable Integer Programming Heuristics Distance Learning

作者: Jian Wang Changyong Niu Ruimin Shen

作者单位: Department of Computer Science and Engineering Shanghai Jiaotong University, Shanghai 200030, China

会议类型: 国际会议

会议名称: 7th International Symposium,APPT 2007(第7届高级并行处理技术大会)

会议地点: 广州

会议语种:英文

页码: 580-589

在线出版日期: 2007-11-22（万方平台首次上网日期，不代表论文的发表时间）