Scheduling meetings in distance learning

Authors:
Jian Wang;Changyong Niu;Ruimin Shen
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, China
Venue:
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Year:
2007

Citing 4
Cited 1

Timetable Scheduling Using Particle Swarm Optimization

ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 3
Modelling an academic curriculum plan as a mixed-initiative constraint satisfaction problem

AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
The timetable constrained distance minimization problem

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A multistage evolutionary algorithm for the timetable problem

IEEE Transactions on Evolutionary Computation

A meeting scheduling problem respecting time and space

Geoinformatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.