Scheduling algorithms for procrastinators
From MaRDI portal
Publication:835586
DOI10.1007/s10951-007-0038-4zbMath1168.90423arXivcs/0606067OpenAlexW1986250791MaRDI QIDQ835586
Kostas Tsichlas, Raphaël Clifford, Michael A. Bender
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0606067
NP-completeonline schedulingstretchhit-the-highest-nailinterval stretchprocrastinateprocrastinatorsum-of-squares problem
Related Items
The many facets of upper domination ⋮ OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success ⋮ Upper Domination: Complexity and Approximation ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling jobs with varying processing times
- The lazy bureaucrat scheduling problem
- Minimizing the total weighted completion time of deteriorating jobs
- Online scheduling of parallel programs on heterogeneous systems with applications to Cilk
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
- Scheduling with time dependent processing times: Review and extensions
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Speed scaling to manage energy and temperature
- Algorithms for Scheduling Tasks on Unrelated Processors
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Energy-Efficient Algorithms for Flow Time Minimization
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- STACS 2005
- Approximation and Online Algorithms
