Sciweavers

7 search results - page 1 / 2
» An Improved Memetic Algorithm for Break Scheduling
Sort
View
HM
2010
Springer
146views Optimization» more  HM 2010»
13 years 4 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
COR
2010
121views more  COR 2010»
13 years 4 months ago
A multi-objective approach for robust airline scheduling
We present a memetic approach for multi-objective improvement of robustness influencing features (called robustness objectives) in airline schedules. Improvement of the objectives...
Edmund K. Burke, Patrick De Causmaecker, Geert De ...
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
13 years 8 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
ECRTS
2003
IEEE
13 years 10 months ago
Using Supertasks to Improve Processor Utilization in Multiprocessor Real-Time Systems
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...
Philip Holman, James H. Anderson
CPAIOR
2005
Springer
13 years 10 months ago
Scheduling Social Golfers Locally
The scheduling of social golfers has attracted significant attention in recent years because of its highly symmetrical and combinatorial nature. In particular, it has become one o...
Iván Dotú, Pascal Van Hentenryck