Efficient multiprocessor scheduling based on genetic algorithms

Document Type

Conference Proceeding

Publication Date

12-1-1990

Abstract

An efficient method, based on genetic algorithms, for solving the multiprocessor scheduling problem is propsed. The representation of the search node is based on the schedule of the tasks in each individual processor. The genetic operator is based on the precedence relations between the tasks in the task graph. The genetic algorithm is applied to the problem of scheduling robot inverse dynamics computations.

Identifier

0025574879 (Scopus)

ISBN

[0879426004]

Publication Title

IECON Proceedings Industrial Electronics Conference

First Page

1239

Last Page

1243

Volume

2

This document is currently not available here.

Share

COinS