Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness

In this paper, we address a new Lagrangian relaxation (LR) method for solving the hybrid flowshop scheduling problem to minimize the total weighted tardiness. For the conventional LR, the problem relaxing machine capacity constraints can be decomposed into individual job-level subproblems which can be solved by dynamic programming. The Lagrangian dual problem is solved by the subgradient method. In this paper, a Lagrangian relaxation with cut generation is proposed to improve the Lagrangian bounds for the conventional LR. The lower bound is strengthened by imposing additional constraints for the relaxed problem. The state space reductions for dynamic programming for subproblems are also incorporated. Computational results demonstrate that the proposed method outperforms the conventional LR method without significantly increasing the total computing time.

[1]  M. Solomon,et al.  Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .

[2]  Ching-Jong Liao,et al.  A discrete particle swarm optimization for lot-streaming flowshop scheduling problem , 2008, Eur. J. Oper. Res..

[3]  X. Zhao,et al.  New Bundle Methods for Solving Lagrangian Relaxation Dual Problems , 2002 .

[4]  T. Ibaraki,et al.  A dynamic programming method for single machine scheduling , 1994 .

[5]  Chengbin Chu,et al.  A more efficient Lagrangian relaxation approach to job-shop scheduling problems , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[6]  Krishna R. Pattipati,et al.  A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..

[7]  X. Zhao,et al.  Surrogate Gradient Algorithm for Lagrangian Relaxation , 1999 .

[8]  Krishna R. Pattipati,et al.  Schedule generation and reconfiguration for parallel machines , 1990, IEEE Trans. Robotics Autom..

[9]  Peter B. Luh,et al.  An alternative framework to Lagrangian relaxation approach for job shop scheduling , 2003, Eur. J. Oper. Res..

[10]  Yves Pochet,et al.  A branch-and-bound algorithm for the hybrid flowshop , 2000 .

[11]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

[12]  Hua Xuan,et al.  A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time , 2006, Comput. Oper. Res..

[13]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[14]  Chengbin Chu,et al.  An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming method , 1998, IEEE Trans. Robotics Autom..

[15]  Débora P. Ronconi,et al.  Tabu search for total tardiness minimization in flowshop scheduling problems , 1999, Comput. Oper. Res..

[16]  Hua Xuan,et al.  Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling , 2007, Comput. Oper. Res..