388 search results - page 19 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
GECCO
2006
Springer
14 years 12 days ago
2006
Springer
This poster investigates the use of Evolutionary Algorithms (EAs) to optimise solutions to the Dynamic Aircraft Landing Problem (DALP). The approach adopted here uses an EA to evo...
GECCO
2000
Springer
14 years 10 days ago
2000
Springer
This paper discusses the issues that arise in the design and implementation of an industrialstrength evolutionary-based system for the optimization of the monthly work schedules f...
PRICAI
2004
Springer
14 years 2 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
IJCAI
1989
13 years 10 months ago
1989
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...
IOR
2006
13 years 8 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...