Heuristics for the exam scheduling problem

被引:1
|
作者
Fu, ZH [1 ]
Lim, A [1 ]
机构
[1] Natl Univ Singapore, Dept Comp Sci, Singapore 117543, Singapore
关键词
D O I
10.1109/TAI.2000.889864
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As part of the process of creating a campus-wide timetabling system for the National University of Singapore, the authors investigated examination scheduling algorithms. The challenge in exam scheduling is to draw up the final examination timetable, taking into account a number of different constraints. The authors propose a different approach when the inter-examination gaps (termed paper spread) of each student should be maximized. The results compare favorably against the actual timetable produced by the current manual system.
引用
收藏
页码:172 / 175
页数:4
相关论文
共 50 条
  • [31] A performance comparison of alternative heuristics for the Flow Shop Scheduling problem
    Esquivel, S
    Leguizamón, G
    Zuppa, F
    Gallard, R
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2002, 2279 : 51 - 60
  • [32] Evaluation of Heuristics for a Resource-Constrained Project Scheduling Problem
    Zhong, Shisheng
    Fu, Xuyun
    Lin, Lin
    Wang, Guolei
    MACHINING AND ADVANCED MANUFACTURING TECHNOLOGY X, 2010, 431-432 : 122 - 125
  • [33] Heuristics for Uniform Parallel Machine Scheduling Problem with Minimizing Makespan
    Li, Kai
    Zhang, Shu-chu
    2008 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2008, : 273 - 278
  • [34] Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times
    Ghaith Rabadi
    Reinaldo J. Moraga
    Ameer Al-Salem
    Journal of Intelligent Manufacturing, 2006, 17 : 85 - 97
  • [35] Heuristics for the unrelated parallel machine scheduling problem with setup times
    Rabadi, G
    Moraga, RJ
    Al-Salem, A
    JOURNAL OF INTELLIGENT MANUFACTURING, 2006, 17 (01) : 85 - 97
  • [36] Effective heuristics for the blocking flowshop scheduling problem with makespan minimization
    Pan, Quan-Ke
    Wang, Ling
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2012, 40 (02): : 218 - 229
  • [37] A beam search heuristics to solve the parcel hub scheduling problem
    McWilliams, Douglas L.
    McBride, Maranda E.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 62 (04) : 1080 - 1092
  • [38] Simple heuristics for the single machine minimum variance scheduling problem
    Al-Turki, U
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2001, 26 (2B): : 127 - 132
  • [39] Heuristics based hybrid approach of flow shop scheduling problem
    Lokesh, K.
    Jayaprakash, J.
    Alene, Tibebu
    4TH INTERNATIONAL CONFERENCE ON DESIGN, ANALYSIS, MANUFACTURING AND SIMULATION (ICDAMS 2020), 2020, 992
  • [40] Heuristics for a flowshop scheduling problem with stepwise job objective function
    Pessoa, Luciana S.
    Andrade, Carlos E.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 266 (03) : 950 - 962