DeepAI AI Chat
Log In Sign Up

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

by   Thomas Lively, et al.

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 polynomial-time approximation, heuristic, and meta-heuristic based algorithms that exist for solving MSP. We also implement Fujita's state-of-the-art Branch-and-Bound algorithm and evaluate the benefit of using Fujita's binary search bounding method instead of the Fernandez bound. We find that in fact Fujita's method does not offer any improvement over the Fernandez bound on our data set.


page 5

page 6


Improved Branch-and-Bound for Low Autocorrelation Binary Sequences

The Low Autocorrelation Binary Sequence problem has applications in tele...

The Complexity of Integer Bound Propagation

Bound propagation is an important Artificial Intelligence technique used...

Optimal and Heuristic Min-Reg Scheduling Algorithms for GPU Programs

Given a basic block of instructions, finding a schedule that requires th...

Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms

The reliable fraction of information is an attractive score for quantify...

The College Application Problem

This paper considers the maximization of the expected maximum value of a...

Learning Computation Bounds for Branch-and-Bound Algorithms to k-plex Extraction

k-plex is a representative definition of communities in networks. While ...

An Enhanced Branch-and-bound Algorithm for the Talent Scheduling Problem

The talent scheduling problem is a simplified version of the real-world ...