Scheduling algorithms for procrastinators

Journal of Scheduling

Volumn 11, Issue 2, 2008, Pages 95-104

  Bender, Michael A ^a   Clifford, Raphaël ^b   Tsichlas, Kostas ^c  

^a Stony Brook University   (United States)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

^c UNIVERSITY OF PATRAS   (Greece)

Author keywords

Hit the highest nail; Interval stretch; NP complete; Online scheduling; Procrastinate; Procrastinator; Stretch; Sum of squares problem

Indexed keywords

COMPUTATION THEORY; JOB ANALYSIS; NUMERICAL METHODS; PERSONNEL; SPEED CONTROL;

INTERVAL STRETCHES; ONLINE SCHEDULING; PROCRASTINATES; PROCRASTINATORS; SUM OF SQUARES PROBLEMS;

SCHEDULING ALGORITHMS;

EID: 40249116989     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-007-0038-4     Document Type: Article

References (28)

1. S. Albers H. Fujiwara 2006 Energy-efficient algorithms for flow time minimization Proceedings of the 23rd annual symposium on theoretical aspects of computer science (STACS) Lecture notes in computer science 3884 Springer Berlin 621 633 Albers, S., & Fujiwara, H. (2006). Energy-efficient algorithms for flow time minimization. In Lecture notes in computer science: Vol. 3884. Proceedings of the 23rd annual symposium on theoretical aspects of computer science (STACS) (pp. 621–633). Berlin: Springer.
2. B. Alidaee K. Womer 1999 Scheduling with time dependent processing times: review and extensions Journal of Operational Research Society 50 711 720 10.2307/3010325 Alidaee, B., & Womer, K. (1999). Scheduling with time dependent processing times: review and extensions. Journal of Operational Research Society, 50, 711–720.
3. Arkin, E. M., Bender, M. A., Mitchell, J. S. B., & Skiena, S. S. (1999). The lazy bureaucrat scheduling problem. In Proceedings of the 6th workshop on discrete algorithms WADS (pp. 122–133).
4. E. M. Arkin M. A. Bender J. S. B. Mitchell S. S. Skiena 2003 The lazy bureaucrat scheduling problem Information and Computation 184 1 129 146 10.1016/S0890-5401(03)00060-9 Arkin, E. M., Bender, M. A., Mitchell, J. S. B., & Skiena, S. S. (2003). The lazy bureaucrat scheduling problem. Information and Computation, 184 (1), 129–146.
5. A. Bachman A. Janiak M. Y. Kovalyov 2002 Minimizing the total weighted completion time of deteriorating jobs Information Processing Letters 81 2 81 84 10.1016/S0020-0190(01)00196-X Bachman, A., Janiak, A., & Kovalyov, M. Y. (2002). Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters, 81 (2), 81–84.
6. N. Bansal K. Pruhs 2005 Speed scaling to manage temperature Proceedings of the 22nd annual symposium on theoretical aspects of computer science (STACS) Lecture Notes in Computer Science 3404 Springer Berlin 460 471 Bansal, N., & Pruhs, K. (2005). Speed scaling to manage temperature. In Lecture Notes in Computer Science: Vol. 3404. Proceedings of the 22nd annual symposium on theoretical aspects of computer science (STACS) (pp. 460–471). Berlin: Springer.
7. Bansal, N., Kimbrel, T., & Pruhs, K. (2004). Dynamic speed scaling to manage energy and temperature. In Proceedings of the 45th symposium on foundations of computer science (FOCS) (pp. 520–529).
8. Bender, M. A., Chakrabarti, S., & Muthukrishnan, S.(1998). Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 270–279).
9. M. A. Bender M. O. Rabin 2002 Online scheduling of parallel programs on heterogeneous systems with applications to Cilk Theory of Computing Systems Special Issue on SPAA00 35 289 304 10.1007/s00224-002-1055-5 Bender, M. A., & Rabin, M. O. (2002). Online scheduling of parallel programs on heterogeneous systems with applications to Cilk. Theory of Computing Systems Special Issue on SPAA00, 35, 289–304.
10. Bunde, D. P. (2006). Power-aware scheduling for makespan and flow. In Proceedings of the 18th ACM symposium on parallelism in algorithms and architectures (SPAA) (pp. 190–196).
11. C. Chekuri M. A. Bender 2001 An efficient approximation algorithm for minimizing makespan on uniformly related machines Journal of Algorithms 41 212 224 10.1006/jagm.2001.1184 Chekuri, C., & Bender, M. A. (2001). An efficient approximation algorithm for minimizing makespan on uniformly related machines. Journal of Algorithms, 41, 212–224.
12. F. A. Chudak D. B. Shmoys 1999 Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds Journal of Algorithms 30 2 323 343 10.1006/jagm.1998.0987 An earlier version appears in SODA ’97 Chudak, F. A., & Shmoys, D. B. (1999). Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Journal of Algorithms, 30 (2), 323–343. An earlier version appears in SODA ’97
13. E. Davis J. M. Jaffe 1981 Algorithms for scheduling tasks on unrelated processors Journal of the ACM 28 4 721 736 10.1145/322276.322284 Davis, E., & Jaffe, J. M. (1981). Algorithms for scheduling tasks on unrelated processors. Journal of the ACM, 28 (4), 721–736.
14. Demaine, E. D., Mitchell, J. S. B., & O’Rourke, J. (2005). The open problems project. Retrieved February 13, 2005 from http://maven.smith.edu/~orourke/TOPP/.
15. Eppstein, D. (2007). Geometry junkyard, computational and recreational geometry pointers. Retrieved April 6, 2007 from http://www.ics.uci.edu/~eppstein/junkyard/open.html.
16. L. Fleischer M. Skutella 2002 The quickest multicommodity flow problem Proceedings of the 9th integer programming and combinatorial optimization (IPCO) conference Lecture notes in computer science 2337 Springer Berlin 36 53 10.1007/3-540-47867-1_4 Fleischer, L., & Skutella, M. (2002). The quickest multicommodity flow problem. In Lecture notes in computer science: Vol. 2337. Proceedings of the 9th integer programming and combinatorial optimization (IPCO) conference (pp. 36–53). Berlin: Springer.
17. Fleischer, L., & Skutella, M. (2003). Minimum cost flows over time without intermediate storage. In Proceedings of the 14th annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 66–75).
18. S. Gawiejnowicz L. Pankowska 1995 Scheduling jobs with varying processing times Information Processing Letters 54 3 175 178 10.1016/0020-0190(95)00009-2 Gawiejnowicz, S., & Pankowska, L. (1995). Scheduling jobs with varying processing times. Information Processing Letters, 54 (3), 175–178.
19. S. Gawiejnowicz W. Kurc L. Pankowska 2002 A greedy approach for a time-dependent scheduling problem Lecture notes in computer science 2328 Springer Berlin 79 86 Gawiejnowicz, S., Kurc, W., & Pankowska, L. (2002). A greedy approach for a time-dependent scheduling problem. In Lecture notes in computer science (Vol. 2328, pp. 79–86). Berlin: Springer.
20. C. Hepner C. Stein 2002 Minimizing makespan for the lazy bureaucrat problem Proceedings of the 8th Scandinavian workshop on algorithm theory (SWAT) Lecture notes in computer science 2368 Springer Berlin 40 50 Hepner, C., & Stein, C. (2002). Minimizing makespan for the lazy bureaucrat problem. In Lecture notes in computer science: Vol. 2368. Proceedings of the 8th Scandinavian workshop on algorithm theory (SWAT) (pp. 40–50). Berlin: Springer.
21. S. Irani K. R. Pruhs 2005 Algorithmic problems in power management SIGACT News 36 2 63 76 10.1145/1067309.1067324 Irani, S., & Pruhs, K. R. (2005). Algorithmic problems in power management. SIGACT News, 36 (2), 63–76.
22. Jansen, K., & Porkolab, L. (1999). Improved approximation schemes for scheduling unrelated parallel machines. In Proceedings of the 31st annual ACM symposium on theory of computing (pp. 408–417).
23. Karger, D., Stein, C., & Wein, J. Scheduling algorithms. In Atallah M. J. (Ed.), Handbook of algorithms and theory of computation, CRC Press, Boca Raton, 1998
24. E. L. Lawler J. Labetoulle 1978 On preemptive scheduling of unrelated parallel processors by linear programming Journal of the ACM 25 4 612 619 10.1145/322092.322101 Lawler, E. L., & Labetoulle, J. (1978). On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM, 25 (4), 612–619.
25. A. Orda R. Rom 1990 Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length J. ACM 37 3 607 625 10.1145/79147.214078 Orda, A., & Rom, R. (1990). Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM, 37 (3), 607–625.
26. O’Rourke, J. (1981). Advanced problem 6369. In American mathematical monthly.
27. Pruhs, K., van Stee, R., & Uthaisombut, P. (2005). Speed scaling of tasks with precedence constraints. In Proceedings of the 3rd workshop on approximation and online algorithms (WAOA) (pp. 307–319).
28. E. Uysal-Biyikoglu B. Prabhakar A. El Gamal 2002 Energy-efficient packet transmission over a wireless link IEEE/ACM Transactions on Networking 10 4 487 499 10.1109/TNET.2002.801419 Uysal-Biyikoglu, E., Prabhakar, B., & El Gamal, A. (2002). Energy-efficient packet transmission over a wireless link. IEEE/ACM Transactions on Networking, 10 (4), 487–499.