Thumbnail
Access Restriction
Open

Author Khadidja, Yahyaoui ♦ Fatima, Debbat ♦ Fayçal, Khelfi Mohamed
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Real-time Task Scheduling Problem Resolution ♦ Hybrid Algorithm ♦ Hybrid Approach ♦ Extensive Test ♦ Intensified Research ♦ Np-hard Problem ♦ Hybrid Heuristic Approach ♦ Key Element ♦ Metaheuristic Method ♦ Different Problem Instance ♦ Several Area ♦ Honey Bee Mating Optimization ♦ Research Space ♦ Real-time Scheduling ♦ Static Periodicity Constraint ♦ Several Experiment
Abstract The problem of real-time scheduling is an NP-Hard problem where each task is characterized by temporal, preemptive and static periodicity constraints. It is therefore necessary to use metaheuristic methods to solve it. This research proposes a hybrid heuristic approach for further improving the quality of solutions. This approach applies Honey Bees Mating Optimization (HBMO) algorithm in combination with one of the best heuristics used to solve this problem Greedy Random Adaptive Search Procedure (GRASP). A key element in the success of this hybrid approach is the use simultaneously an intensified research on several areas of research space. The implementation of these algorithms has been subject to extensive tests. Several experiments are carried out on different problem instances. Results obtained show the advantages and efficiency of our approach.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study