Sciweavers

1719 search results - page 114 / 344
» Scheduling with soft constraints
Sort
View
IOR
2007
106views more  IOR 2007»
13 years 10 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
CORR
2007
Springer
56views Education» more  CORR 2007»
13 years 10 months ago
Duality and Stability Regions of Multi-rate Broadcast and Multiple Access Networks
— We study stability regions of multi-rate Gaussian multiple access (MAC) and broadcast (BC) networks with centralized scheduling algorithms. Techniques are presented to characte...
Viveck R. Cadambe, Syed Ali Jafar
CP
2003
Springer
14 years 4 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
IEEECIT
2006
IEEE
14 years 4 months ago
ILP-based Scheduling for Asynchronous Circuits in Bundled-Data Implementation
In this paper, we propose a new scheduling method for asynchronous circuits in bundled-data implementation. The method is based on integer linear programming (ILP) which explores ...
Hiroshi Saito, Nattha Jindapetch, Tomohiro Yoneda,...
AIPS
2003
14 years 4 days ago
Quality and Utility - Towards a Generalization of Deadline and Anytime Scheduling
Scheduling algorithms for real-time systems can be characterized in various ways, one of the most important ones of which is the underlying task model. Many concepts of real-time ...
Thomas Schwarzfischer