Branch and Bound Approach for Scheduling Problem

Abstract

This thesis presents Branch and Bound method for implementing algorithms for solving different kind of discrete combinatorial problems by using systematic enumeration of all solution candidates. Using bounding values, which defines the range where optimal solution is located, we limit potential solution space. The target of this thesis is to implement such an algorithm for a specific scheduling problem and its variations. The resulting implementation is then used to calculate the set of partial results based on wellknown scheduling problem instances.