AN ASSESSMENT OF HEURISTICS FOR FAST SCHEDULING OF GRID JOBS

Florian Möeser, Wolfgang Süß, Wilfried Jakob, Alexander Quinte, Karl-Uwe Stucky

2010

Abstract

Due to the dynamic nature of the grid and the frequent arrival of new jobs, rescheduling of already planned and new jobs is a permanent process that is in need of good and fast planning algorithms. This paper extends previous work and deals with newly implemented heuristics for our Global Optimizing Resource Broker and Allocator GORBA. Of a range of possibly usable heuristics, the most promising ones have been chosen for implementation and evaluation. They serve for the following two purposes: Firstly, the heuristics are used to quickly generate feasible schedules. Secondly, these schedules go into the start population of a subsequent run of our Evolutionary Algorithm incorporated in GORBA for improvement. The effect of the selected heuristics is compared to our best simple one used in the first version of GORBA. The investigation is based on two synthetically generated benchmarks representing a load of 300 grid jobs each. A formal definition of the scheduling problem is given together with an assessment of its complexity. The results of the evaluation underline the described intricacy of the problem, because none of the heuristics performs better than our simple one, although they work well on other presumably easier problems.

References

  1. Adams, J., Balas, E., and Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. MANAGEMENT SCIENCE, 34(3).
  2. Baykasog?lu, A., O zbakir, L., and Dereli, T. (2002). Multiple dispatching rule based heuristic for multi-objective scheduling of job shops using tabu search. In Proceedings of MIM 2002: 5th Int. Conf. on Managing Innovations in Manufacturing (MIM), pages 396-402, Milwaukee, Wisconsin, USA.
  3. Blume, C. (1991). GLEAM - a system for simulated 'intuitive learning'. In Schwefel, H.-P. and Männer, R., editors, PPSN I (1990), LNCS 496, pages 48-54. Springer.
  4. Blume, C. and Jakob, W. (2002). GLEAM - an evolutionary algorithm for planning and control based on evolution strategy. In Cantú-Paz, E., editor, GECCO 2002, volume LBP, pages 31-38.
  5. Blume, C. and Jakob, W. (2009). GLEAM - General Learning Evolutionary Algorithm and Method : ein Evolutionrer Algorithmus und seine Anwendungen, volume 32 of Schriftenreihe des AIA. (in German), KIT Scientific Publishing, Karlsruhe.
  6. Brucker, P. (2004). Scheduling Algorithms. Springer, Berlin Heidelberg.
  7. Brucker, P. (2006). Complex Scheduling. Springer, Berlin Heidelberg.
  8. Chen, K.-P., Lee, M. S., Pulat, P. S., and Moses, S. A. (2006). The shifting bottleneck procedure for jobshops with parallel machines. Int. Journal of Industrial and Systems Engineering 2006, 1(1/2):244-262.
  9. Dauzère-Pérès, S. and Lasserre, J. B. (1993). A modified shifting bottleneck procedure for job-shop scheduling. Int. Journal of Prod. Research, 31(4):923-932.
  10. Giffler, B. and Thompson, G. L. (1960). Algorithms for solving production scheduling problems. Operations Research, 8:487-503.
  11. Jakob, W. (2006). Towards an adaptive multimeme algorithm for parameter optimisation suiting the engineers' need. In Runarsson, T. P., Beyer, H.-G., and Merelo-Guervos, J. J., editors, PPSN IX, LNCS 4193, pages 132-141, Berlin. Springer.
  12. Jakob, W., Quinte, A., Stucky, K.-U., and S üß, W. (2008). Fast multi-objective scheduling of jobs to constrained resources using a hybrid evolutionary algorithm. In Rudolph, G., Jansen, T., Lucas, S. M., Poloni, C., and Beume, N., editors, PPSN X, LNCS 5199, pages 1031-1040. Springer.
  13. Jakob, W., Quinte, A., S üß, W., and Stucky, K.-U. (2009). Fast multi-objective rescheduling of grid jobs by heuristics and evolution. In Conf. Proc. PPAM 2009 (to be published in LNCS), Berlin. Springer.
  14. Möser, F. (2009). Integration von Optimierungsalgorithmen in den Grid Resource Broker GORBA. (in German) Bachelor Thesis, DHBW Karlsruhe, Karlsruhe Institute of Technology.
  15. Neumann, K. and Morlock, M. (2002). Operations Research. Carl Hanser, München.
  16. Pitsoulis, L. S. and Resende, M. G. C. (2001). Greedy randomized adaptive search procedures. In Pardalos, P. M. and Resende, M. G. C., editors, Handbook of Applied Optimization, pages 168-181. Oxford University Press.
  17. Schuster, C. J. (2003). No-wait Job-Shop Scheduling: Komplexität und Local Search. PhD thesis, Universität Duisburg-Essen, Duisburg.
  18. Setämaa-Kärkkäinen, A., Miettinen, K., and Vuori, J. (2006). Best compromise solution for a new multiobjective scheduling problem. Computers & Computers and Operations Research archive, 33(8):2353-2368.
  19. Sonnleithner, D. (2008). Integration eines GifflerThompson-Schedulers in GORBA. (in German), research paper, Faculty of Mechanical Engineering, University of Karlsruhe.
  20. S üß, W., Quinte, A., Jakob, W., and Stucky, K.-U. (2007). Construction of benchmarks for comparison of grid resource planning algorithms. In Filipe, J., Shishkov, B., and Helfert, M., editors, ICSOFT 2007, Proc. of the Second ICSOFT, Volume PL/DPS/KE/WsMUSE, Barcelona, Spain, July 22-25, 2007, pages 80-87. Inst. f. Systems and Techn. of Inf., Control and Com., INSTICC Press.
Download


Paper Citation


in Harvard Style

Möeser F., Süß W., Jakob W., Quinte A. and Stucky K. (2010). AN ASSESSMENT OF HEURISTICS FOR FAST SCHEDULING OF GRID JOBS . In Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-989-8425-22-5, pages 184-191. DOI: 10.5220/0002919201840191


in Bibtex Style

@conference{icsoft10,
author={Florian Möeser and Wolfgang Süß and Wilfried Jakob and Alexander Quinte and Karl-Uwe Stucky},
title={AN ASSESSMENT OF HEURISTICS FOR FAST SCHEDULING OF GRID JOBS},
booktitle={Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT,},
year={2010},
pages={184-191},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002919201840191},
isbn={978-989-8425-22-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT,
TI - AN ASSESSMENT OF HEURISTICS FOR FAST SCHEDULING OF GRID JOBS
SN - 978-989-8425-22-5
AU - Möeser F.
AU - Süß W.
AU - Jakob W.
AU - Quinte A.
AU - Stucky K.
PY - 2010
SP - 184
EP - 191
DO - 10.5220/0002919201840191