This paper presents a genetic algorithmic approach to the solution of the problem of personnel timetabling in laboratories in which the objective is to assign tasks to employees and nurse scheduling in medical centre where the objectives are to assign staff to particular day in planning period and minimization of personnel cost by avoiding overtime pay. The personnel scheduling and timetabling ...

In this paper we introduce a new algorithm for secondary school timetabling, inspired by the classical bipartite graph edge colouring algorithm for basic class-teacher timetabling. We give practical methods for generating large sets of meetings that can be timetabled to run simultaneously, and for building actual timetables based on these sets. We report promising empirical results for one real...

A common weakness of local search metaheuristics, such as Simulated Annealing, in solving combinatorial optimisation problems, is the necessity of setting a certain number of parameters. This tends to make significantly increase the total amount of time required to solve the problem and often requires a high level of experience from the user. This paper is motivated by the goal of overcoming th...

In our system for recording and transmitting lectures over the Internet the board content is sent as vector graphics, yielding a high quality image, while the video of the lecturer is sent as a separate stream. It is easy for the viewer to read the board, but the lecturer appears in a separate window. To eliminate this problem, we segment the lecturer from the video stream and paste his image o...

sure to reduce costs while improving service delivery. A central component to this effort is the availability of timetabling systems that can find practical solutions to maximizing the utilization of teaching resources, such as facilities and staff, while not compromising on education quality. Traditional university timetabling is often concerned with the task of assigning a number of events, s...

Classical notions of disjunctive and cumulative scheduling are studied from the point of view of soft constraint satisfaction. Soft disjunctive scheduling is introduced as an instance of soft CSP and preferences included in this problem are applied to generate a lower bound based on existing discrete capacity resource. Timetabling problems at Purdue University and Faculty of Informatics at Masa...

This paper introduces a Grammar-based Genetic Programming Hyper-Heuristic framework (GPHH) for evolving constructive heuristics for timetabling. In this application GP is used as an online learning method which evolves heuristics while solving the problem. In other words, the system keeps on evolving heuristics for a problem instance until a good solution is found. The framework is tested on so...

The university course timetabling problem involves assigning a given number of events (including lectures, seminars, labs, tutorials, etc) into a limited number of timeslots and rooms subject to given set of constraints. Two primary hard constraints are that no student should be assigned two events in one timeslot and that capacity and features of rooms should satisfy the requirement of the eve...

This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At the second level, we aim at supplying a feasible production schedule for a set of interruptible tasks with qualification requirements and time-windows. Instead of hierarchically solving these two problems as in the cur...

A large number of heuristic algorithms have been developed over the years which have been aimed at solving examination timetabling problems. However, many of these algorithms have been developed specifically to solve one particular problem instance or a small subset of instances related to a given real-life problem. Our aim is to develop a more general system which, when given any exam timetabl...