Scheduling parallel jobs to minimize the makespan

Journal of Scheduling

Volumn 9, Issue 5, 2006, Pages 433-452

  Johannes, Berit ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Approximation algorithms; List scheduling; Multiprocessor scheduling; Online algorithms; Parallel jobs; Release dates

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL MODELS; ONLINE SYSTEMS; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; LIST SCHEDULING; MULTIPROCESSOR SCHEDULING; ONLINE ALGORITHMS; PARALLEL JOBS; RELEASE DATES;

SCHEDULING;

EID: 33745215820     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-006-8497-6     Document Type: Article

References (39)

1. Albers, S. "Better bounds for online scheduling," SIAM Journal on Computing, 29, 459-473 (1999).
2. Amoura, A. K., E. Bampis, C. Kenyon, and Y. Manoussakis, "Scheduling independent multiprocessor tasks," in R. Burkard and G. Woeginger (eds.), Algorithms-ESA '97, Lecture Notes in Computer Science 1284, Springer, Berlin, 1997, pp. 1-12.
3. Baker, B. S., E. G. Coffman, Jr., and R. L. Rivest, " Orthogonal packings in two dimensions," SIAM Journal on Computing, 9, 846-855 (1980).
4. Bażewicz, J., M. Drabowski, and J. Wȩglarz, "Scheduling multiprocessor tasks to minimize schedule length," IEEE Transactions on Computers, 35, 389-393 (1986).
5. Chen, B. and A. P. A. Vestjens, "Scheduling on identical machines: How good is LPT in an on-line setting,"Operations Research Letters, 21, 165-169 (1997).
6. Chen, J. and A. Miranda, "A polynomial time approximation scheme for general multiprocessor job scheduling," in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 418-427.
7. Coffman, E. G., Jr. M. R. Garey., D. S. Johnson, and R. E. Tarjan, "Performance bounds for level-oriented two-dimensional packing algorithms," SIAM Journal on Computing, 9, 808-826 (1980).
8. Drozdowski, M., "On complexity of multiprocessor task scheduling," Bulletin of the Polish Academy of Sciences, Technical Sciences, 43, 437-445 (1994).
9. Drozdowski, M., "Scheduling multiprocessor tasks - an overview," European Journal of Operational Research, 64, 215-230 (1996).
10. Du, J. and J. Y.-T. Leung, "Complexity of scheduling parallel task systems," SIAM Journal of Discrete Mathematics, 2, 473-487 (1989).
11. Feitelson, D. G., "A survey of scheduling in multiprogrammed parallel systems," Research Report RC 19790 (87657), IBM T. J. Watson Research Center, Oct. 1994, revised Aug. 1997.
12. Feitelson, D. G., L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong, "Theory and practice in parallel job scheduling," in D. G. Feitelson and L. Rudolph (eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1291, Springer, Berlin, 1997, pp. 1-34..
13. Feldmann, A., J. Sgall, and S.-H. Teng," Dynamic scheduling on parallel machines," Theoretical Computer Science, 130, 49-72 (1994).
14. Fleischer, R. and M. Wahl, "On-line scheduling revisited," Journal of Scheduling, 3, 343-353 (2000).
15. Garey, M. R. and R. L. Graham, "Bounds for multiprocessor scheduling with resource constraints," SIAM Journal on Computing, 4, 187-200 (1975).
16. Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA. 1979.
17. Golan, I., "Performance bounds for orthogonal oriented two-dimensional packing algorithms," SIAM Journal on Computing, 10, 571-582 (1981).
18. Gonzalez, T. F. and D. B. Johnson, "A new algorithm for preemptive scheduling of trees," Journal of the Association for Computing Machinery, 27, 287-312 (1980).
19. Graham, R. L., "Bounds for certain multiprocessing anomalies," Bell System Technical Journal, 45, 1563-1581 (1966).
20. Graham, R. L., "Bounds on multiprocessing timing anomalies," SIAM Journal of Applied Mathematics, 17, 416-426 (1969).
21. Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey," Annals of Discrete Mathematics, 5, 287-326 (1979).
22. Gusfield, D., "Bounds for naive multiple machine scheduling with release times and deadlines," Journal of Algorithms, 5, 1-6 (1984).
23. Hall, L. A. and D. B. Shmoys, "Approximation schemes for constrained scheduling problems," in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989 pp. 134-139.
24. Hochbaum, D. S., and Shmoys, D. B., "Using dual approximation algorithms for scheduling problems: Theoretical and practical results," Journal of the Association for Computing Machinery, 34, 144-162 (1987).
25. Horn, W. A., "Some simple machine scheduling algorithms," Naval Research Logistics Quarterly, 21, 177-185 (1974).
26. Jansen, K. and L. Porkolab, "Linear-time approximation schemes for scheduling malleable parallel tasks," in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 490-498.
27. Jansen, K. and L. Porkolab, "Preemptive parallel task scheduling in O(n) + poly(m) time," in D. T. Lee and S.-H. Teng (eds.), Algorithms and Computation, Lecture Notes in Computer Science 1969, Springer, Berlin, 2000, pp. 398-409.
28. Johannes, B., Obere und untere Schranken für die Güte von Heuristiken und Relaxierungen im Maschinen Scheduling, Diplomarbeit, Institut für Mathematik, Technische Universität Berlin, Germany, June 2001; partly published in B. Johannes, Scheduling parallel jobs to minimize makespan, Technical Report 723/2001, Institut für Mathematik, Technische Universität Berlin, Germany.
29. Kenyon, C. and E. Remua, "Approximative strip packing," in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 31-36.
30. Li, K., "Analysis of an approximation algorithm for scheduling independent parallel tasks," Discrete Mathematics and Theoretical Computer Science, 3, 1999, 155-166.
31. Ludwig, W., and P. Tiwari, "Scheduling malleable and nonmalleable tasks," in Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 167-176.
32. McNaughton, R., "Scheduling with deadlines and loss functions," Management Science, 6, 1-12 (1959).
33. Mu'alem, A. W. and D. G. Feitelson, "Preemptive bicriteria scheduling for parallel jobs: Off-line and on-line algorithms. Technical Report 99-36," Leibniz Center for Research in Computer Science, Hebrew University, Jerusalem, Israel, Dec. 1999.
34. Naroska, E. and U. Schwiegelshohn, "On an online scheduling problem for parallel jobs," Information Processing Letters, 81, 297-304 (2002).
35. Sgall, J., "On-line scheduling," in A. Fiat and G. J. Woeginger (eds.), Online Algorithms, Lecture Notes in Computer Science 1442, Springer, Berlin, 1998, pp. 197-231.
36. Shmoys, D. B., J. Wein, and D. P. Williamson, "Scheduling parallel machines on-line," SIAM Journal on Computing, 24, 1313-1331 (1995).
37. Sleator, D., "A 2.5 times optimal algorithm for packing in two dimensions," Information Processing Letters, 10, 37-40 (1980).
38. Steinberg, A., "A strip-packing algorithm with absolute performance bound 2,"SIAM Journal on Computing, 26, 401-409 (1997).
39. Turek, J., J. L. Wolf, and P. S. Yu, "Approximate algorithms for scheduling parallelizable tasks," in Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 323-332.