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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Jakob, W., Quinte, A., Stucky, K. U., & Süß, W. (2008). Fast multi-objective scheduling of jobs to constrained resources using a hybrid evolutionary algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5199 LNCS, pp. 1031–1040). https://doi.org/10.1007/978-3-540-87700-4_102
Mendeley helps you to discover research relevant for your work.