Sciweavers

128 search results - page 2 / 26
» A generic library of problem solving methods for scheduling ...
Sort
View
CP
1998
Springer
13 years 9 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
CCE
2004
13 years 5 months ago
Modeling and solving real-time scheduling problems by stochastic integer programming
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
Guido Sand, Sebastian Engell
MOR
2002
94views more  MOR 2002»
13 years 4 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
SCP
2011
341views Communications» more  SCP 2011»
13 years 4 days ago
A generic topology library
In the field of scientific computing there is a manifold of software applications and tools available which provide methods and libraries for the solution of very specific prob...
René Heinzl, Philipp Schwaha
RTAS
2008
IEEE
13 years 11 months ago
Equivalence between Schedule Representations: Theory and Applications
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
Matthieu Lemerre, Vincent David, Christophe Aussag...