Online Job Scheduling Mechanisms : How Bad are Restarts ?

We investigate the power of online algorithms and mechanism s for two different classic models of preemptive online job sched uling. These two models areresumptiveandnon-resumptivejob scheduling. The distinction is when we decide to allocate a previously preempted job. In the resu mptive model we resume the job’s allocation as if no preemption has occurred. I n the non-resumptive model the job’s allocation is restarted. We perform this com parison in two different models ofstandardandmetered. We provide several Mechanisms and lower bounds for these different models.

[1]  Mohammad Taghi Hajiaghayi,et al.  Adaptive limited-supply online auctions , 2004, EC '04.

[2]  Robert D. Kleinberg.  A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.

[3]  Nodari Vakhania,et al.  Preemptive Scheduling in Overloaded Systems , 2002, ICALP.

[4]  Atri Rudra,et al.  Dynamic pricing for impatient bidders , 2007, SODA '07.

[5]  Francis Y. L. Chin,et al.  Improved competitive algorithms for online scheduling with partial job values , 2004, Theor. Comput. Sci..

[6]  Mohammad Taghi Hajiaghayi,et al.  Automated Online Mechanism Design and Prophet Inequalities , 2007, AAAI.

[7]  Yuichi Sato,et al.  Cause of the memory effect observed in alkaline secondary batteries using nickel electrode , 2001 .

[8]  Ryan Porter,et al.  Mechanism design for online real-time scheduling , 2004, EC '04.

[9]  Ee-Chien Chang,et al.  Competitive Online Scheduling with Level of Service , 2001, COCOON.

[10]  A. Jossen,et al.  Reliable battery operation — a challenge for the battery management system , 1999 .

[11]  Rudi Kaiser,et al.  Optimized battery-management system to improve storage lifetime in renewable energy systems , 2007 .

[12]  Noam Nisan,et al.  Online ascending auctions for gradually expiring items , 2005, SODA '05.

[13]  Vijay Kumar,et al.  Online learning in online auctions , 2003, SODA '03.

[14]  Wei-Kuan Shih,et al.  Algorithms for scheduling imprecise computations , 1991, Computer.

[15]  Frank Thomson Leighton,et al.  The value of knowing a demand curve: bounds on regret for online posted-price auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[16]  Nicole Immorlica,et al.  Matroids, secretary problems, and online mechanisms , 2007, SODA '07.