Invigilator scheduling for faculty final examination
This study concerns with the invigilator scheduling problem at faculty. For this, both the hard and soft constraints considered are clearly defined. The main hard constraint is invigilator can only invigilate one exam at a time. Besides, the soft constraint is evenly spread of invigilation duties...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Year Project Report |
| Language: | English |
| Published: |
Universiti Malaysia Sarawak, (UNIMAS)
2015
|
| Subjects: | |
| Online Access: | http://ir.unimas.my/id/eprint/39416/2/Teo%20Mei%20Gie%28fulltext%29.pdf http://ir.unimas.my/id/eprint/39416/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This study concerns with the invigilator scheduling problem at faculty. For this, both
the hard and soft constraints considered are clearly defined. The main hard constraint is
invigilator can only invigilate one exam at a time. Besides, the soft constraint is evenly spread
of invigilation duties among the staffs. The problem is formulated as a zero-one integer linear
programming in which its variables correspond to the assignment decision are representative
by binary integer, 0 and 1. Hardly any mathematical models have been used in the past since
the problem has its own constraints and multiple objective structures. Therefore, simple
heuristic approaches are used to assign invigilator to examination rooms. |
|---|