The objective of the scheduling soft real-time tasks is to minimize total tardiness and the scheduling these tasks on multiprocessor system is NP-hard problem. In this chapter, scheduling algorithms for soft real-time tasks using genetic algorithm (GA) are introduced. GA has been known to offer significant advantages against conventional heuristics by using simultaneously several search principles and heuristics. The objective of this study is to propose reasonable solutions for NP-hard scheduling problem which much less difficulties than those of traditional mathematical methods. A continuous task scheduling, real-time task scheduling on homogeneous system and real-time task scheduling on heterogeneous system are included in this chapter. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gen, M., & Yoo, M. (2008). Real time tasks scheduling using hybrid genetic algorithm. Studies in Computational Intelligence, 96, 319–350. https://doi.org/10.1007/978-3-540-76827-2_13
Mendeley helps you to discover research relevant for your work.