A scatter search algorithm for real-time scheduling with timing, precedence and exclusion constraints.

Please use this identifier to cite or link to this item: http://dspace.centre-univ-mila.dz/jspui/handle/123456789/1775

Full metadata record

DC Field	Value	Language
dc.contributor.author	Adel, Bouridah	-
dc.date.accessioned	2022-06-23T10:44:14Z	-
dc.date.available	2022-06-23T10:44:14Z	-
dc.date.issued	2013-01	-
dc.identifier.citation	Filière : Mathématiques et informatiques.	en_US
dc.identifier.other	Vol. 5	-
dc.identifier.uri	http://dspace.centre-univ-mila.dz/jspui/handle/123456789/1775	-
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	Abdelhafid boussouf university Centre mila .	en_US
dc.relation.ispartofseries	No. 2;	-
dc.subject	real-time; pre-run-time scheduling; meta-heuristic; scatter search	en_US
dc.title	A scatter search algorithm for real-time scheduling with timing, precedence and exclusion constraints.	en_US
dc.type	Article	en_US
Appears in Collections:	Mathematics and Computer Science

Files in This Item:

File	Description	Size	Format
A scatter search algorithm for real-time scheduling.pdf		305,12 kB	Adobe PDF	View/Open