Search Sciweavers | Sciweavers

27

ORL
2008

87views more ORL 2008»

On-line scheduling with non-crossing constraints

13 years 8 months ago

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

claim paper

Read More »

25

click to vote

CN
2006

110views more CN 2006»

Maximal lifetime scheduling for K to 1 sensor-target surveillance networks

13 years 10 months ago

Download www.comp.hkbu.edu.hk

This paper addresses the maximal lifetime scheduling for k to 1 sensor

Hai Liu, Peng-Jun Wan, Xiaohua Jia

claim paper

Read More »

34

click to vote

ORL
2008

112views more ORL 2008»

A monotone approximation algorithm for scheduling with precedence constraints

13 years 10 months ago

Download www.mpi-inf.mpg.de

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...

claim paper

Read More »

21

click to vote

CN
1999

91views more CN 1999»

Universal Timestamp-Scheduling for real-time networks

13 years 9 months ago

Download www.utdallas.edu

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

claim paper

Read More »

33

click to vote

IOR
2007

106views more IOR 2007»

Planning and Scheduling by Logic-Based Benders Decomposition

13 years 10 months ago

Download wpweb2.tepper.cmu.edu

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

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers