Scheduling jobs with varying processing times
Information Processing Letters
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors
Journal of the ACM (JACM)
Energy-efficient packet transmission over a wireless link
IEEE/ACM Transactions on Networking (TON)
Minimizing the total weighted completion time of deteriorating jobs
Information Processing Letters
Minimum cost flows over time without intermediate storage
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Quickest Multicommodity Flow Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Greedy Approach for a Time-Dependent Scheduling Problem
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Minimizing Makespan for the Lazy Bureaucrat Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
The Lazy Bureaucrat scheduling problem
Information and Computation
Dynamic Speed Scaling to Manage Energy and Temperature
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Algorithmic problems in power management
ACM SIGACT News
Power-aware scheduling for makespan and flow
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Energy-Efficient algorithms for flow time minimization
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Speed scaling of tasks with precedence constraints
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Speed scaling to manage temperature
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Online scheduling to minimize the maximum delay factor
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Longest wait first for broadcast scheduling [extended abstract]
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Hi-index | 0.00 |
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.