Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
—This paper discusses several important aspects in the HSUPA scheduling algorithms. First, it clearly demonstrates the benefit of explicitly utilizing the directly measured Rise-...
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
This paper deals with the load-balancing of machines in a real-world job-shop scheduling problem, with identical machines. The load-balancing algorithm allocates jobs, split into l...
The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In...
Fatos Xhafa, Juan Antonio Gonzalez, Keshav P. Daha...