Scheduling of steelmaking-continuous casting process using deflected surrogate Lagrangian relaxation approach and DC algorithm

Abstract This paper investigates a hybrid flowshop scheduling (HFS) problem in the steelmaking continuous casting (SCC) process. Firstly, a mathematical model is built for the SCC scheduling problem. By relaxing the machine capacity constraint, the SCC scheduling problem can be transformed into a DC (difference of convex functions) programming problem, which can solved by using DC algorithm. Under some reasonable assumptions, the convergence of the DC algorithm is analyzed. Secondly, we propose an effective and efficient deflected surrogate subgradient method with global convergence to solve the Lagrangian dual (LD) problem. Thirdly, a simple heuristic method is designed to obtain a feasible scheduling. Lastly, we report some computational experiments to demonstrate the effectiveness of the proposed surrogate subgradient method by comparing with other similar surrogate subgradient methods.

[1]  M. Selim Akturk,et al.  Two-machine flowshop scheduling with flexible operations and controllable processing times , 2013, Comput. Oper. Res..

[2]  Dario Pacciarelli,et al.  Production scheduling in a steelmaking-continuous casting plant , 2004, Comput. Chem. Eng..

[3]  Jianyu Long,et al.  Practical Production Scheduling for Hot Metal Pretreatment-Steelmaking-Continuous Casting Process Involving Preventive Maintenance Consideration , 2018, IEEE Access.

[4]  Shih-Ho Wang.  An improved stepsize of the subgradient algorithm for solving the lagrangian relaxation problem , 2003, Comput. Electr. Eng..

[5]  Le Thi Hoai An,et al.  DC programming and DCA: thirty years of developments , 2018, Math. Program..

[6]  Min Liu,et al.  A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry , 2015, Comput. Ind. Eng..

[7]  Quan-Ke Pan,et al.  Solving the steelmaking casting problem using an effective fruit fly optimisation algorithm , 2014, Knowl. Based Syst..

[8]  Ling Wang,et al.  A modified teaching–learning-based optimisation algorithm for bi-objective re-entrant hybrid flowshop scheduling , 2016 .

[9]  Le Thi Hoai An,et al.  DC programming in communication systems: challenging problems and methods , 2014, Vietnam Journal of Computer Science.

[10]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[11]  P. Luh,et al.  On the Surrogate Gradient Algorithm for Lagrangian Relaxation , 2007 .

[12]  P. Tseng.  Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization , 2001 .

[13]  Rubén Ruiz,et al.  A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times , 2011, Eur. J. Oper. Res..

[14]  Tao Ding,et al.  Parallel Augmented Lagrangian Relaxation for Dynamic Economic Dispatch Using Diagonal Quadratic Approximation Method , 2017, IEEE Transactions on Power Systems.

[15]  Vincent T'Kindt,et al.  Scheduling batches in flowshop with limited buffers in the shampoo industry , 2012, Eur. J. Oper. Res..

[16]  H. Sherali,et al.  A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems , 1989 .

[17]  Bernardo Almada-Lobo,et al.  Lot sizing and scheduling: industrial extensions and research opportunities , 2011 .

[18]  Quan-Ke Pan,et al.  An Improved Artificial Bee Colony Algorithm for Solving Hybrid Flexible Flowshop With Dynamic Operation Skipping , 2016, IEEE Transactions on Cybernetics.

[19]  Peter B. Luh,et al.  An Effective Subgradient Method for Scheduling a Steelmaking-Continuous Casting Process , 2015, IEEE Transactions on Automation Science and Engineering.

[20]  Lixin Tang,et al.  A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex , 2007, Eur. J. Oper. Res..

[21]  Yongheng Jiang,et al.  Efficient Lagrangian Decomposition Approach for Solving Refinery Production Scheduling Problems Involving Operational Transitions of Mode Switching , 2015 .

[22]  Peter B. Luh,et al.  Convergence of the Surrogate Lagrangian Relaxation Method , 2015, J. Optim. Theory Appl..

[23]  Tianyou Chai,et al.  A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process , 2014, Eur. J. Oper. Res..

[24]  Jie Li,et al.  Robust optimization and stochastic programming approaches for medium-term production scheduling of a large-scale steelmaking continuous casting process under demand uncertainty , 2014, Comput. Chem. Eng..

[25]  Ali Diabat,et al.  A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem , 2015 .

[26]  Hubert Missbauer,et al.  A scheduling system for the steelmaking-continuous casting process. A case study from the steel-making industry , 2009 .

[27]  Lixin Tang,et al.  A mathematical programming model for scheduling steelmaking-continuous casting production , 2000, Eur. J. Oper. Res..

[28]  Lixin Tang,et al.  An Improved Differential Evolution Algorithm for Practical Dynamic Scheduling in Steelmaking-Continuous Casting Production , 2014, IEEE Transactions on Evolutionary Computation.

[29]  Stéphane Dauzère-Pérès,et al.  A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem , 2015, Eur. J. Oper. Res..

[30]  Peter B. Luh,et al.  An optimization-based algorithm for job shop scheduling , 1997 .

[31]  Quan-Ke Pan,et al.  An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling , 2016, Eur. J. Oper. Res..

[32]  Lixin Tang,et al.  A hybrid two-stage transportation and batch scheduling problem , 2008 .

[33]  Liang Gao,et al.  An Improved Artificial Bee Colony algorithm for real-world hybrid flowshop rescheduling in Steelmaking-refining-Continuous Casting process , 2018, Comput. Ind. Eng..

[34]  Tianyou Chai,et al.  An Effective Heuristic Rescheduling Method for Steelmaking and Continuous Casting Production Process With Multirefining Modes , 2016, IEEE Transactions on Systems, Man, and Cybernetics: Systems.