In: Proceedings of the 2004 IEEE Conference on Robotics, Automation and Mechatronics,Singapore, 1-3 December, 2004, pages 271-276. December 2004.
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.
Keywords: Manufacturing system; branch and bound; task scheduling; discrete event; Petri net.