Timetabling is a classic problem with practical applications. Based on the available literature on timetable generation, it is clear that the process of automation gives rise to difficulties while trying to incorporate all the constraints involved. The fast elegant simple heuristic proposed here is used for multi-campus university where the faculty belongs to a common teaching pool Administrative processes are adopted to overcome constraints at various levels of hierarchy. The timetable is generated in constant time. The heuristic finds application in various scheduling problems such as: flight scheduling, train scheduling etc.
展开▼
