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) This article does not cite any sources . Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources:  "Fernandez's method"  –  news · newspapers · books · scholar · JSTOR (April 2012) ( Learn how and when to remove this message ) This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details.(November 2021) ( Learn how and when to remove this message ) ( Learn how and when to remove this message )

Fernandez's method (FB) in computer science and operations research, is a method which is used in the multiprocessor scheduling algorithm. 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's problem derives a better lower bound than HF^{[ clarification needed ]}, and propose a quadratic-time algorithm from calculating the bound. It is known that a straightforward calculation of FB takes O${\displaystyle (n^{3})}$ time, since it must examine O${\displaystyle (n^{2})}$ combinations each of which takes O${\displaystyle (n)}$ time in the worst case.

Further reading

• A Comparison of List Scheduling for Parallel Processing Systems^{[ full citation needed ]}

References

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e