Fernandez's method
(Redirected from 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 template messages)
|
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 time, since it must examine O combinations each of which takes O time in the worst case.
Further reading
- A Comparison of List Scheduling for Parallel Processing Systems[full citation needed]
References
Categories:
- Articles lacking sources from April 2012
- All articles lacking sources
- Wikipedia articles that are too technical from November 2021
- All articles that are too technical
- Articles with multiple maintenance issues
- Wikipedia articles needing clarification from November 2021
- All articles with incomplete citations
- Articles with incomplete citations from June 2024
- Optimization algorithms and methods
- All stub articles
- Computing stubs