146 search results - page 7 / 30 » A hybrid constraint programming approach to the log-truck sc... |
CP
2004
Springer
15 years 2 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
AIPS
2009
14 years 10 months ago
2009
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
64
Voted
CP
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...