Fernandez's method
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
No issues specified. Please specify issues, or remove this template. |
Fernandez method is a method which is used in the Multiprocessing scheduling algorithm. It is also represented by FB. It is actually used to improve the quality of the lower bounding schemes which are adopted by Branch and Bound algorithms for solving Multiprocessor scheduling problem. Fernandez problem derives a better lower bound than HF,and propose a quadratic-time algorithm fro calculating the bound. It is known that a straightforward calculation of FB takes O(n3) time, since it must examine O(n2) combinations each of which takes O(n) time int he worst case.
For further references you can refer
A Comparison of List Scheduling for Parallel Processing Systems.
 | This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles. (April 2012) |