Sciweavers

2355 search results - page 24 / 471
» Scheduling in the Z-Polyhedral Model
Sort
View
ANOR
2011
214views more  ANOR 2011»
13 years 4 months ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
DFG
2009
Springer
14 years 4 months ago
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz,...
HIPC
2005
Springer
14 years 3 months ago
Scheduling Multiple Flows on Parallel Disks
We examine the problem of scheduling concurrent independent flows on multiple-disk I/O storage systems. Two models are considered: in the shared buffer model the memory buffer is ...
Ajay Gulati, Peter J. Varman
CN
2008
118views more  CN 2008»
13 years 10 months ago
Modeling and computing throughput capacity of wireless multihop networks
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
Patrick Stuedi, Gustavo Alonso
ICC
2008
IEEE
109views Communications» more  ICC 2008»
14 years 4 months ago
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
Yung Yi, Mung Chiang