Sciweavers

218 search results - page 3 / 44
» A Symbolic Approach for the Combined Solution of Scheduling ...
Sort
View
ATAL
2009
Springer
13 years 12 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...
EOR
2010
113views more  EOR 2010»
13 years 2 months ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
CP
2008
Springer
13 years 7 months ago
A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine
The Cell BE processor provides both scalable computation power and flexibility, and it is already being adopted for many computational intensive applications like aerospace, defens...
Luca Benini, Michele Lombardi, Michela Milano, Mar...
IOR
2007
106views more  IOR 2007»
13 years 5 months 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
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
13 years 7 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz