Sciweavers

5 search results - page 1 / 1
» A Comparison of Annealing Techniques for Academic Course Sch...
Sort
View
PATAT
1997
Springer
107views Education» more  PATAT 1997»
13 years 9 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...
AAAI
2004
13 years 6 months ago
A Comparison of Techniques for Scheduling Earth Observing Satellites
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...
Al Globus, James Crawford, Jason D. Lohn, Anna Pry...
TSMC
2011
324views more  TSMC 2011»
12 years 12 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
EVOW
2004
Springer
13 years 10 months ago
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
Wouter Boomsma
CCE
2006
13 years 5 months ago
State-of-the-art review of optimization methods for short-term scheduling of batch processes
There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. The main go...
Carlos A. Méndez, Jaime Cerdá, Ignac...