A self-adaptive greedy scheduling scheme for a multi-objective optimization on identical parallel machines

Liya Fan*, Fa Zhang, Gongming Wang, Bo Yuan, Zhiyong Liu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A self-adaptive greedy scheduling scheme is presented to solve a Multi-Objective Optimization on Identical Parallel Machines. The primary objective is to minimize the makespan, while the secondary objective makes the schedule more stable. Actual experiments revealed that the scheme obtained the optimal primary and secondary objectives for most cases. Moreover, schedules produced by the scheme were more robust, with smaller makespans. Additionally, it has been applied to parallelize one major component of EMAN, one of the most popular software packages for cryo-electron microscopy single particle reconstruction. Besides, it can also be used in practice to parallelize other similar applications.

Original languageEnglish
Title of host publicationSoftware Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing
EditorsRoger Lee, Naohiro Ishii
Pages43-55
Number of pages13
DOIs
Publication statusPublished - 2009
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
Volume209
ISSN (Print)1860-949X

Fingerprint

Dive into the research topics of 'A self-adaptive greedy scheduling scheme for a multi-objective optimization on identical parallel machines'. Together they form a unique fingerprint.

Cite this