Task scheduling in manufacturing systems based on an efficient branch and bound algorithm

Abstract

The branch and bound (BB) algorithm is one of the common used methods in solving the task scheduling problems in manufacturing systems. In this paper, we introduced a new method to apply the branch and bound algorithm with a reduced memory size. By this method the running time decreases considerably. The algorithm is applied to a combinational discrete job shop scheduling system, where a Petri net is used for modeling.