Sciweavers

976 search results - page 5 / 196
» The Complexity of Timetable Construction Problems
Sort
View
EOR
2010
119views more  EOR 2010»
13 years 6 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
PATAT
1997
Springer
107views Education» more  PATAT 1997»
13 years 10 months ago
A Comparison of Annealing Techniques for Academic Course Scheduling
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simu...
M. A. Saleh Elmohamed, Paul D. Coddington, Geoffre...
WSC
1998
13 years 8 months ago
The Use of Simulation in the Planning of the Dutch Railway Services
The design of a quality timetable for the Dutch Railways is a complex task, because of the characteristics of the railway services. The complexity of the network and the heavily i...
Jurjen S. Hooghiemstra, Maurice J. G. Tunisse
EOR
2007
198views more  EOR 2007»
13 years 6 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
CPAIOR
2007
Springer
14 years 26 days ago
Modeling the Regular Constraint with Integer Programming
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
Marie-Claude Côté, Bernard Gendron, L...