Sciweavers

82 search results - page 2 / 17
» Maximizing Job Completions Online
Sort
View
ORL
2002
81views more  ORL 2002»
13 years 4 months ago
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
Leah Epstein, John Noga, Gerhard J. Woeginger
GECON
2008
Springer
152views Business» more  GECON 2008»
13 years 5 months ago
The Power of Preemption in Economic Online Markets
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
Lior Amar, Ahuva Mu'alem, Jochen Stößer
IPL
2008
80views more  IPL 2008»
13 years 4 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
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
13 years 11 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng
STACS
2004
Springer
13 years 10 months ago
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs
Yair Bartal, Francis Y. L. Chin, Marek Chrobak, St...