Fast Multi-objective Scheduling of Jobs to Constrained Resources Using a Hybrid Evolutionary Algorithm

被引:0
作者
Jakob, Wilfried [1 ]
Quinte, Alexander [1 ]
Stucky, Karl-Uwe [1 ]
Suess, Wolfgang [1 ]
机构
[1] Forschungszentrum Karlsruhe, Inst Appl Comp Sci, D-76021 Karlsruhe, Germany
来源
PARALLEL PROBLEM SOLVING FROM NATURE - PPSN X, PROCEEDINGS | 2008年 / 5199卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:1031 / 1040
页数:10
相关论文
共 10 条
[1]  
[Anonymous], OPERATIONS RES
[2]  
[Anonymous], 1991, Handbook of genetic algorithms
[3]  
Bierwirth C., 1996, LECT NOTES COMPUTER, V1141, P310, DOI DOI 10.1007/3-540-61723-X_995
[4]  
BLUME C, 2002, LATE BREAKING PAPERS
[5]  
Brucker P, 2006, GOR-PUBL, P1, DOI 10.1007/3-540-29546-1
[6]  
Brucker Peter, 2004, Scheduling Algorithms
[7]   The anatomy of the grid: Enabling scalable virtual organizations [J].
Foster, I ;
Kesselman, C ;
Tuecke, S .
INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2001, 15 (03) :200-222
[8]   ALGORITHMS FOR SOLVING PRODUCTION-SCHEDULING PROBLEMS [J].
GIFFLER, B ;
THOMPSON, GL .
OPERATIONS RESEARCH, 1960, 8 (04) :487-503
[9]   Best compromise solution for a new multiobjective scheduling problem [J].
Setämaa-Kärkkäinen, A ;
Miettinen, K ;
Vuori, J .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (08) :2353-2368
[10]  
SUSS W, 2007, C P ICSOFT 2007 I F, VPL, P80