Hybrid Algorithm Based on HBMO and GRASP For Real-time Task Scheduling Problem Resolution
Khadidja Yahyaoui, Fatima Debbat, Mohamed Fayçal Khelfi · 2012
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.