This is an old revision of this page, as edited by Yobot(talk | contribs) at 11:48, 7 January 2015(Tagging using AWB (10703)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 11:48, 7 January 2015 by Yobot(talk | contribs)(Tagging using AWB (10703))
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[disambiguation needed],and propose a quadratic-time algorithm from 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 in the worst case.
Further reading
A Comparison of List Scheduling for Parallel Processing Systems
