By Topic

Heuristic techniques: scheduling partially ordered tasks in a multi-processor environment with tabu search and genetic algorithms

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
$33 $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)
M. Lin ; Dept. of Comput. Sci., Linkoping Univ., Sweden ; L. Karlsson ; L. T. Yang

Scheduling real-time computation is an extremely important activity in real-time systems, since it is the phase in which we assign the final temporal properties of the computations. The problem of allocating the resources in real-time systems creates an additional dimension within the conventional allocation problem, that of time constraints. The scheduling problem has been extensively examined in the literature. But optimization of valid schedules is an NP-hard problem, even for simple cases. Therefore, heuristic approaches seem appropriate to these classes of problems. In this paper, we investigate scheduling problems with certain kinds of temporal constraints and how these problems can be solved with the techniques of tabu search and genetic algorithms

Published in:

Parallel and Distributed Systems: Workshops, Seventh International Conference on, 2000

Date of Conference:

Oct 2000