Estimation of Distribution Algorithms for Job Schedule Problem

Author

Li, Jun ; Jiang, Yong

Author_Institution

Dept. of Inf. & Comput. Sci., Nanjing Univ. of Sci. & Technol., Nanjing, China

Volume

1

fYear

2009

fDate

21-22 May 2009

Firstpage

7

Lastpage

10

Abstract

Well known job schedule problem is NP-hard in management and operating system. A few of evolution algorithms such as GA have been proposed to approach this kind of problems. At present estimation of distribution algorithms are the leading heuristic algorithms which overcome the defect of tradition GA and reflex more excellent property than others. In this paper effective of EDA are tested by the job scheduling problem and the simulation results are analyzed in details.

Keywords

combinatorial mathematics; computational complexity; distributed algorithms; evolutionary computation; optimisation; processor scheduling; NP-hard problem; combinatorial optimization problem; estimation-of-distribution algorithm; evolution algorithm; job schedule problem; operating system; uniprocessor; Conference management; Distributed computing; Electronic design automation and methodology; Graphical models; Heuristic algorithms; Operating systems; Processor scheduling; Scheduling algorithm; Technology management; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Computing Science, 2009. ICIC '09. Second International Conference on

Conference_Location

Manchester

Print_ISBN

978-0-7695-3634-7

Type

conf

DOI

10.1109/ICIC.2009.9

Filename

5169526