Scheduling algorithms for procrastinators

Abstract This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line scheduling policies for linearly increasing speed functions. We then explain the computational/numerical issues involved in implementing this policy. We next explore the online setting, showing that there exist adversaries that force any online scheduling policy to miss due dates. This impossibility result motivates the problem of minimizing the maximum interval stretch of any job; the interval stretch of a job is the job’s flow time divided by the job’s due date minus release time. We show that several common scheduling strategies, including the “hit-the-highest-nail” strategy beloved by procrastinators, have arbitrarily large maximum interval stretch. Then we give the “thrashing” scheduling policy and show that it is a Θ(1) approximation algorithm for the maximum interval stretch.

[1]  Kirk Pruhs,et al.  Dynamic speed scaling to manage energy and temperature , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[2]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[3]  Susanne Albers,et al.  Energy-efficient algorithms for flow time minimization , 2006, STACS.

[4]  Michael A. Bender,et al.  An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines , 1998, IPCO.

[5]  Adam Janiak,et al.  Minimizing the total weighted completion time of deteriorating jobs , 2002, Inf. Process. Lett..

[6]  Sandy Irani,et al.  Algorithmic problems in power management , 2005, SIGA.

[7]  Kirk Pruhs,et al.  Speed Scaling to Manage Temperature , 2005, STACS.

[8]  Michael A. Bender,et al.  An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines , 2001, J. Algorithms.

[9]  Michael A. Bender,et al.  Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk , 2002, SPAA '00.

[10]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[11]  Jeffrey M. Jaffe,et al.  Algorithms for Scheduling Tasks on Unrelated Processors , 1981, JACM.

[12]  Fabián A. Chudak,et al.  Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.

[13]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[14]  Clifford Stein,et al.  Minimizing Makespan for the Lazy Bureaucrat Problem , 2002, SWAT.

[15]  Elif Uysal-Biyikoglu,et al.  Energy-efficient packet transmission over a wireless link , 2002, TNET.

[16]  Klaus Jansen,et al.  Improved approximation schemes for scheduling unrelated parallel machines , 1999, STOC '99.

[17]  OrdaAriel,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990 .

[18]  Erik D. Demaine,et al.  The Open Problems Project , 2007 .

[19]  Kirk Pruhs,et al.  Speed Scaling of Tasks with Precedence Constraints , 2005, WAOA.

[20]  Martin Skutella,et al.  Minimum cost flows over time without intermediate storage , 2003, SODA '03.

[21]  Stanislaw Gawiejnowicz,et al.  Scheduling Jobs with Varying Processing Times , 1995, Inf. Process. Lett..

[22]  Martin Skutella,et al.  The Quickest Multicommodity Flow Problem , 2002, IPCO.

[23]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[24]  Steven Skiena,et al.  The Lazy Bureaucrat scheduling problem , 1999, Inf. Comput..

[25]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[26]  Stanislaw Gawiejnowicz,et al.  A Greedy Approach for a Time-Dependent Scheduling Problem , 2001, PPAM.

[27]  David P. Bunde.  Power-aware scheduling for makespan and flow , 2006, SPAA '06.