By Topic

Greedy Scheduling with Complex Obejectives

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Franke, C. ; SAP Res. CEC Belfast, Ulster Univ., Newtownabbey ; Lepping, J. ; Schwiegelshohn, U.

We present a methodology for automatically generating an online scheduling process for an arbitrary objective with the help of evolution strategies. The scheduling problem comprises independent parallel jobs and multiple identical machines and occurs in many real massively parallel processing systems. The system owner defines the objective that may consider job waiting times and priorities of user groups. Our scheduling process is a variant of the simple and commonly used greedy scheduling algorithm in combination with a repeated sorting of the waiting queue. This sorting uses a criterion whose parameters are evolutionary optimized. We evaluate our new scheduling process with real workload data and compare it to the best offline solutions and to the online results of the standard EASY backfill algorithm. To this end, we partition the user of the workloads into groups and select an exemplary objective that prioritizes some of those groups over others

Published in:

Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on

Date of Conference:

1-5 April 2007