Sciweavers

1380 search results - page 50 / 276
» scheduling 2008
Sort
View
94
Voted
ORL
2008
87views more  ORL 2008»
14 years 11 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth
CN
2006
110views more  CN 2006»
15 years 23 days ago
Maximal lifetime scheduling for K to 1 sensor-target surveillance networks
This paper addresses the maximal lifetime scheduling for k to 1 sensor
Hai Liu, Peng-Jun Wan, Xiaohua Jia
109
Voted
ORL
2008
112views more  ORL 2008»
15 years 21 days ago
A monotone approximation algorithm for scheduling with precedence constraints
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
Sven Oliver Krumke, Anne Schwahn, Rob van Stee, St...
94
Voted
CN
1999
91views more  CN 1999»
15 years 12 days ago
Universal Timestamp-Scheduling for real-time networks
Consider a network of computers interconnected by point-to-point communication channels. For each flow of packets through the network, the network reserves a fraction of the packe...
Jorge Arturo Cobb
108
Voted
IOR
2007
106views more  IOR 2007»
15 years 19 days 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