论文信息 - A rolling horizon procedure with optimal operation assignment for job shop scheduling problems

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.

Zuo Yan | Guo Baofeng | Zhou Xiaohui | Xue Anke

[1] Robert H. Storer,et al. A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness , 1999, Oper. Res..

[2] Marcos Singer,et al. Decomposition methods for large job shops , 2001, Comput. Oper. Res..

[3] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .

[4] Reha Uzsoy,et al. Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication , 2007, J. Sched..

[5] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .

[6] Michael Pinedo,et al. A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops , 1998 .

[7] Michael Pinedo,et al. A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop , 1999 .

[8] Ari P. J. Vepsalainen. Priority rules for job shops with weighted tardiness costs , 1987 .

[9] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[10] Cheng Wu,et al. A prediction based iterative decomposition algorithm for scheduling large-scale job shops , 2008, Math. Comput. Model..