388 search results - page 4 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
CPAIOR
2005
Springer
14 years 2 months ago
2005
Springer
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...
COR
2011
13 years 3 months ago
2011
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we ...
CP
1998
Springer
14 years 28 days ago
1998
Springer
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...
IJCAI
1993
13 years 10 months ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
COR
2010
13 years 8 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...