Authors: Roland Braune
In this paper we perform investigations on the Shifting Bottleneck Procedure for weighted tardiness job shop scheduling problems. We propose machine prioritization rules which explicitly consider the specific structure of the occurring subproblems and compare them with conventional criteria. We study their effects in combination with alternative subproblem solution methods. Furthermore, we analyze the role of machine backtracking as an advanced control structure. Computational results are presented based on a set of adapted benchmark problems.