A scatter search algorithm for real-time scheduling with timing, precedence and exclusion constraints Online publication date: Mon, 28-Apr-2014
by Adel Bouridah; Habiba Drias; Yacine Laalaoui
International Journal of Advanced Operations Management (IJAOM), Vol. 5, No. 2, 2013
Abstract: Tasks scheduling is one of the most important challenges in embedded hard-real-time systems. The problem is known to be NP-hard and exhaustive search algorithms have no significant benefit in large-scale context. This paper proposes a scatter search-based approach for mono-processor systems with timing, precedence and exclusion constraints with no pre-emption. An empirical study is undertaken and comparison is done with results of other algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Operations Management (IJAOM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com