FMS scheduling using branch-and-bound with heuristics

The generic noncyclic jobshop scheduling problem is solved by an algorithm based on the classical branch-and-bound method. In order to find an optimal solution, the branch-and-bound algorithm searches the decision tree representing all possible sequences of operations for the jobshop scheduling problem. Essential parts of the branch-and-bound scheme which guarantee that the method will find the optimal schedule are substituted by heuristics in such a way that the resulting algorithm will create at least a good schedule within an acceptable computation time