Sciweavers

703 search results - page 54 / 141
» Maintenance scheduling problems as benchmarks for constraint...
Sort
View
IOR
2007
106views more  IOR 2007»
14 years 9 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
INFOCOM
2005
IEEE
15 years 3 months ago
Power controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas
Abstract— We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is t...
Arindam Kumar Das, Robert J. Marks II, Payman Arab...
CIA
2007
Springer
15 years 3 months ago
Quantifying the Expected Utility of Information in Multi-agent Scheduling Tasks
Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complet...
Avi Rosenfeld, Sarit Kraus, Charlie Ortiz
85
Voted
HEURISTICS
2006
197views more  HEURISTICS 2006»
14 years 9 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
104
Voted
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
14 years 9 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...