The aim of this paper is not to offer any definite proposal for the scheduling competition, but to discuss some of the key issues to be considered in such an endeavour. The discussion will refer to three types of scheduling problems: production scheduling, employee scheduling (the discussion will be focused on nurse rostering being a very complex and highly constrained scheduling problem) and u...

The modeling and solution approaches being used to automate construction of course timetables at a large university are discussed. A course structure model is presented that allows this complex real-world problem to be described using a classical formulation. The problem is then tackled utilizing a course timetabling solver model that transforms it into a constraint satisfaction and optimizatio...

This paper proposes a mathematical goal program for the design of timetables radiologists. The converts tedious monthly tasks head radiology department leading hospital to simple optimization problem that abides regulations Ministry Health and avoids conflicting issues may arise among coworkers. which is designed tactical level can also be used at strategic ( i.e. , account long time horizon) p...

The International Timetabling Competition 2002 has been organized by the Metaheuristic Network in order to compare different algorithms in a common measurable ground. All information about problem definition, instances, rules, and solution evaluation is available at the webpage http://www.idsia.ch/ Files/ttcomp2002/, and for the sake of brevity we do not repeat them here. We have participated i...

Automated examination timetabling has been addressed by a wide variety of methodologies and techniques over the last ten years or so. Many of the methods in this broad range of approaches have been evaluated on a collection of benchmark instances provided at the University of Toronto in 1996. Whilst the existence of these datasets has provided an invaluable resource for research into examinatio...

Timetabling problems are often hard and time-consuming to solve. Profits from full automatization of this process can be invaluable. Although over the years many solutions have been proposed, most of the methods concern only one problem instance or class. This paper describes a possibly universal method for solving large, highly constrained timetabling problems from different areas. The solutio...