Greedy scheduling with complex objectives

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007

Volumn , Issue , 2007, Pages 113-120

  Franke, Carsten ^a,b   Lepping, Joachim ^c   Schwiegeishohn, Uwe ^c  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF ULSTER   (United Kingdom)

^c Section Information Technology (IRF IT)   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ONLINE SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING ALGORITHMS;

AUTOMATICALLY GENERATING; COMPLEX OBJECTIVES; OFFLINE SOLUTIONS;

SCHEDULING;

EID: 34548799113     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCIS.2007.367678     Document Type: Conference Paper

References (21)

1. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey," Annals of Discrete Mathematics, vol. 15, pp. 287-326, 1979.
2. D. A. Lifka, "The ANL/IBM SP scheduling system," in Proceedings of Job Scheduling Strategies for Parallel Processing (JSSPP95), ser. Lecture Notes in Computer Science (LNCS), vol. 949. Springer, 1995, pp. 295-303.
3. U. Schwiegelshohn and R. Yahyapour, "Fairness in parallel job scheduling," Journal of Scheduling, vol. 3. no. 5, pp. 297-320, 2000.
4. D. G. Feitelson and A. M. Weil, "Utilization and predictability in scheduling the IBM SP2 with backfilling," in Proceedings of the 12th International Parallel Processing Symposium and the 9th Symposium on Parallel and Distributed Processing. IEEE Computer Society Press, 1998, pp. 542-547.
5. D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong, "Theory and practice in parallel job scheduling," in Proceedings of Job Scheduling Strategies for Parallel Processing (JSSPP97), ser. Lecture Notes in Computer Science (LNCS), vol. 1291. Springer, 1997, pp. 1-34.
6. D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn, "Parallel job scheduling -a status report," in Proceedings of Job Scheduling Strategies for Parallel Processing (JSSPP04), ser. Lecture Notes in Computer Science (LNCS), vol. 3277. Springer, 2004, pp. 1-16.
7. D. G. Feitelson and M. A. Jette, "Improved Utilization and Responsiveness with Gang Scheduling," in Proceedings of the 3rd Job Scheduling Strategies for Parallel Processing, ser. Lecture Notes in Computer Science (LNCS), D. G. Feitelson and L. Rudolph, Eds., vol. 1291. Springer, 1997, pp. 238-261.
8. C. B. Lee, Y. Schwartzman, J. Hardy, and A. Snavely, "Are user runtime estimates inherently inaccurate?" in Proceedings of Job Scheduling Strategies for Parallel Processing (JSSPP05), ser. Lecture Notes in Computer Science (LNCS), vol. 3277. Springer, April 2005, pp. 253-263.
9. D. G. Feitelson, "Parallel workload archive," http://www.cs.huji.ac.il/Iabs/parallel/workload/, October 2006.
10. H.-G. Beyer and H.-P. Schwefel, "Evolution strategies - A comprehensive introduction." Natural Computing, vol. 1, no. 1, pp. 3-52, 2002.
11. T. Bäck and H.-P. Schwefel, "An overview of evolutionary algorithms for parameter optimization," Evolutionary Computation, vol. 1, no. 1, pp. 1-23, 1993.
12. A. Hertz, E. Taillard, and D. de Werra, Local Search in Combinatorial Optimization. Wiley, 1997, ch. Tabu search, pp. 121-136.
13. E. H. L. Aarts. J. H. M. Korst, and P. J. M. van Laarhoven, Local Search in Combinatorial Optimization. Wiley, 1997, ch. Simulated annealing, pp. 91-120.
14. A. B. Downey and D. G. Feitelson, "The elusive goal of workload characterization," Performance Evaluation Review, vol. 26, no. 4, pp. 14-29, 1999.
15. U. Schwiegelshohn and R. Yahyapour, Grid Resource Management State of the Art and Future Trends. Kluwer Academic Publishers, 2003, ch. Attributes for Communication Between Grid Scheduling Instances, pp. 41-52.
16. C. Ernemann, B. Song, and R. Yahyapour, "Scaling of workload traces," in Proceedings of Job Scheduling Strategies for Parallel Processing (JSSPP03), ser. Lecture Notes in Computer Science (LNCS). D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn, Eds., vol. 2862. Springer, October 2003, pp. 166-183.
17. C. Ernemann, U. Schwiegelshohn, M. Emmerich, L. Schönemann, and N. Beume, "Scheduling algorithm development based on complex owner defined objectives," SFB 531. CI-Report. University of Dortmund, Tech. Rep. 191/05, January 2005.
18. J. Balicki and Z. Kitowski, "Multicriteria evolutionary algorithm with tabu search for task assignment," in Proceedings of the 1st International Conference on Evolutionary Multi-Criterion Optimization (EMO01), ser. Lecture Notes in Computer Science (LNCS), E. Zitzler, K. Deb, L. Thiele, C. A. Coello Coello, and D. Come, Eds., vol. 1993. Springer, 2001, pp. 373-384.
19. E. K. Burke, B. McCollum, A. Meisels, S. Petrovic, and R. Qu, "Graphbased hyper-heuristic for timetabling problems," European Journal of Operational Research, vol. 176, no. 1, pp. 177-192, 2007.
20. E. K. Burke, S. Petrovic, and R. Qu, "Case based heuristic selection for timetabling problem," Journal of Scheduling, vol. 9, no. 2, pp. 115-132, 2006.
21. C. Franke, J. Lepping, and U. Schwiegelshohn, "On advantages of scheduling using genetic fuzzy systems," in Proc. 12th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), ser. Lecture Notes in Computer Science (LNCS), E. Frachtenberg and U.Schwiegelshohn, Eds., vol. 4376. Springer, 2006, pp. 68-93.