22 search results - page 3 / 5 » Solving a Location-Allocation Problem with Logic-Based Bende... |
AAAI
2007
14 years 12 months ago
2007
A facility with front room and back room operations has the option of hiring specialized or, more expensive, cross-trained workers. Assuming stochastic customer arrival and servic...
CP
2006
Springer
15 years 1 months ago
2006
Springer
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
CONSTRAINTS
2006
14 years 9 months ago
2006
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...
79
Voted
DATE
2007
IEEE
15 years 3 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
131
Voted
CP
2005
Springer
15 years 3 months ago
2005
Springer
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...