Analyzing Branch-and-Bound Algorithms for the Multiprocessor Scheduling Problem

Thomas Lively, William Long, Artidoro Pagnoni

The Multiprocessor Scheduling Problem (MSP) is an NP-Complete problem with significant applications in computer and operations systems. We provide a survey of the wide array of pol…