Fernandez's method (FB) in

computer science Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to practical disciplines (includi ...

and

operations research Operations research ( en-GB, operational research) (U.S. Air Force Specialty Code: Operations Analysis), often shortened to the initialism OR, is a discipline that deals with the development and application of analytical methods to improve decis ...

, is a method which is used in the multiprocessor scheduling

algorithm In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing ...

. It is actually used to improve the quality of the lower bounding schemes which are adopted by

branch and bound Branch and bound (BB, B&B, or BnB) is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as mathematical optimization. A branch-and-bound algorithm consists of a systematic enumeration of candidate solut ...

algorithms for solving multiprocessor scheduling problem. Fernandez's problem derives a better lower bound than HF, and propose a quadratic-time algorithm from calculating the bound. It is known that a straightforward calculation of FB takes O

(n^3)

time, since it must examine O

(n^2)

combinations each of which takes O

(n)

time in the worst case.

References

Optimization algorithms and methods {{computing-stub

Further reading

References