A rolling horizon procedure with optimal operation assignment for job shop scheduling problems

A rolling horizon procedure (RHP) with optimal operation assignment is present for the job shop scheduling problem with minimizing the total weighted tardiness. Different from the traditional RHP, we construct each subproblem with global performance considering the effect of operation assignment in each time window. Then a heuristic branch and bound algorithm is proposed to solve it optimally in a rolling horizon scheme. Computational results indicate that the proposed method is effective and outperforms the traditional RHP and some dispatching rules.