Sciweavers

IOR
2007
106views more  IOR 2007»
14 years 10 days ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
INFORMS
2008
62views more  INFORMS 2008»
14 years 13 days ago
Edge Finding for Cumulative Scheduling
Edge-finding algorithms for cumulative scheduling are at the core of commercial constraint-based schedulers. This paper shows that Nuijten's edge finder for cumulative schedu...
Luc Mercier, Pascal Van Hentenryck
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
14 years 14 days ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
CP
2005
Springer
14 years 6 months ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker