A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors
Résumé
In this paper, we investigate the use of a hybrid method for approximately solving the problem of scheduling multiprocessor tasks on two dedicated processors. Such a problem is NP-hard and its goal is to provide the best order of available tasks assigned either to one processor, or simultaneously to two processors such that the execution of the last assigned task should be minimized. Starting with a solution provided by a knapsack procedure, the algorithm combines a series of operators oscillating between both intensification and diversification strategies. For each internal/current solution, a reactive search is used for enhancing the quality of that solution. In order to highlight the global search space, a drop/rebuild strategy is incorporated around the best solution achieved. Finally, the performance of the hybrid method is experimentally analyzed on a set of benchmark instances, where its achieved results are compared to those reached by the best method available in the literature. New results have been provided.