Sciweavers

120 search results - page 1 / 24
» Tractable Optimal Competitive Scheduling
Sort
View
AIPS
2006
13 years 6 months ago
Tractable Optimal Competitive Scheduling
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...
MST
2008
157views more  MST 2008»
13 years 4 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
IPL
2008
80views more  IPL 2008»
13 years 5 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
STACS
2004
Springer
13 years 10 months ago
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
Tomás Ebenlendr, Jiri Sgall
ICPADS
2006
IEEE
13 years 11 months ago
Joint Optimization of MAC and Network Coding for Cooperative and Competitive Wireless Multicasting
In this paper, we address the problem of cross-layer optimization in medium access control (MAC) and network layers for wireless multicasting with multiple cooperative or competit...
Yalin Evren Sagduyu, Anthony Ephremides