Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5199))
Included in the following conference series:
-
3826 Accesses
-
13 Citations
Abstract
The problem tackled here combines three properties of scheduling tasks, each of which makes the basic task more challenging: job scheduling with precedence rules, co-allocation of restricted resources of different performances and costs, and a multi-objective fitness function. As the algorithm must come up with results within a few minutes runtime, EA techniques must be tuned to this limitation. The paper describes how this was achieved and compares the results with a common scheduling algorithm, the Giffler-Thompson procedure.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling
Explore related subjects
Discover the latest articles, books and news in related subjects, suggested using machine learning.References
Foster, I., Kesselman, C.: The Anatomy of the Grid: Enabling Scalable Virtual Organisations. Int. J. of Supercomputer Applications 15(3), 200–222 (2001)
Brucker, P.: Scheduling Algorithms. Springer, Berlin (2004)
Setamaa-Karkkainen, A., Miettinen, K., Vuori, J.: Best Compromise Solution for a New Multiobjective Scheduling Problem. Computers & OR 33(8), 2353–2368 (2006)
Brucker, P., Knust, S.: Complex Scheduling. Springer, Berlin (2006)
Giffler, B., Thompson, G.L.: Algorithms for Solving Production Scheduling Problems. Operations Research 8, 487–503 (1960)
Neumann, K., Morlock, M.: Operations Research. Carl Hanser, München (2002)
Süß, W., Quinte, A., Jakob, W., Stucky, K.-U.: Construction of Benchmarks for Comparison of Grid Resource Planning Algorithms. In: Filipe, J., et al. (eds.) Conf. Proc. ICSOFT 2007, vol. PL, Inst.f. Systems and Techn. of Information, Control and Com., pp. 80–87 (2007)
Blume, C., Jakob, W.: GLEAM – An Evolutionary Algorithm for Planning and Control Based on Evolution Strategy. In: Conf. Proc. GECCO 2002, Late Breaking Papers (2002)
Davis, L. (ed.): Handbook of Genetic Algorithms. V. Nostrand Reinhold, New York (1991)
Bierwirth, C., Mattfeld, D.C., Kopfer, H.: On Permutation Representations for Scheduling Problems. In: Voigt, H.-M., et al. (eds.) PPSN IV, vol. 1141, pp. 310–318. Springer, Heidelberg (1996)
Editor information
Editors and Affiliations
Fakultät für Informatik, Technische Universität Dortmund, 44221, Dortmund, Germany
Günter Rudolph
Fakultät für Informatik, Technische Universität Dortmund, 44221, Dortmund, Germany
Thomas Jansen & Nicola Beume &
Department of Computing and Electronic Systems, University of Essex, CO4 3SQ, Colchester, Essex, UK
Simon Lucas
Dipartimento di Ingegneria Meccanica, Università degli Studi di Trieste, 34127, Trieste, Italy
Carlo Poloni
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jakob, W., Quinte, A., Stucky, KU., Süß, W. (2008). Fast Multi-objective Scheduling of Jobs to Constrained Resources Using a Hybrid Evolutionary Algorithm. In: Rudolph, G., Jansen, T., Beume, N., Lucas, S., Poloni, C. (eds) Parallel Problem Solving from Nature – PPSN X. PPSN 2008. Lecture Notes in Computer Science, vol 5199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87700-4_102
Download citation
DOI: https://doi.org/10.1007/978-3-540-87700-4_102
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87699-1
Online ISBN: 978-3-540-87700-4
eBook Packages: Computer Science Computer Science (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.