150 search results - page 17 / 30 » Hybrid Constraint Tightening for Solving Hybrid Scheduling P... |
HM
2009
Springer
14 years 1 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
GECCO
2006
Springer
14 years 3 days ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
ANOR
2007
13 years 8 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
EVOW
2006
Springer
14 years 3 days ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...