Production Scheduling Optimization Algorithm for the Steel-Making Continuous Casting Processes

Document Type : Research Paper

Author

Department of Industrial Engineering, Yazd University, Yazd, Iran

Abstract

This paper investigates steel-making continuous casting (SCC) scheduling problem. SCC is a high temperature and large-scale logistics machining process with batch production at the last stage that was identified as the key process of modern iron and steel enterprises. This paper presents a mathematical model for scheduling SCC process. The model is developed as a Mixed Zero- One Linear programming (MZOLP) based on actual production situations of SCC. The objective is to schedule a set of charges (jobs) to minimize the earliness and tardiness penalty costs as well as the charge waiting time cost. The solution methodology is developed based on a branch-and-bound algorithm. A heuristic method is presented at the beginning of the search in order to compute an initial upper bound. A lower bound and an upper bound are developed and a method for reducing branches is established based on the batch production in the continuous casting (CC) stage. Moreover, branching schemes are proposed. The branch- and- bound algorithm incorporating the initial upper bound, the lower and upper bound, the method for reducing branches, and branching schemes is tested on a set of instances. The analysis shows the efficiency of the proposed features for the algorithm.

Keywords

References

                          [1]        Tang, L., Liu, J., Rong, A., and Yang, Z. “A review of planning and scheduling systems and methods for integrated steel production”, European Journal of operational research, 133, 1- 20 (2001).
                          [2]        Tang, L., Liu, J., Rong, A., and Yang Z. “A mathematical programming model for scheduling steelmaking- continuous casting production”, European Journal of Operatoinal Research, 120, 423- 435 (2000).
                          [3]        Atighehchian, A., Bijari, M., and Tarkesh, H. “A novel hybrid algorithm for scheduling steel-making continuous casting production”, Computers & Operations Research, 36, 2450- 2461 (2009).
                          [4]        Tang, L., Luh, P. B., Liu, J., and Fang, L. “Steel-making process scheduling using Lagrangian relaxation”, International Journal of Production Research, 40 (1), 55- 70 (2002).
                          [5]        Xuan, H., and Tang L. “Scheduling a hybrid flow shop with batch production at the last stage”, Computers & Operations Research, 34, 2718- 2733 (2007).
                          [6]        Harjunkoski, I., and Grossmann, I. E. “A decomposition approach for the scheduling of a steel plant production”, Computers and Chemical Engineering, 25, 1647- 1660 (2001).
                          [7]        Gupta, J.N.D., Hariri, A.M.A., and Potts, C.N. “Scheduling a two-stage hybrid flow shop with parallel machines at the first stage”, Annals of Operations Research, 69, 171- 191 (1997).
                          [8]        Missbauera, H., Hauberb, W., and Stadler, W. “A scheduling system for the steelmaking-continuous casting process. A case study from the steel-making industry”, International Journal of Production Research, 47, 4147- 4172 (2009).
                          [9]        Sun, L. “Scheduling of Steel-making and Continuous Casting System Using the Surrogate Subgradient Algorithm for Lagrangian Relaxation”, 6th annual IEEE Conference on Automation Science and Engineering, Toronto, Ontario, Canada, August 21- 24 (2010).
                        [10]      Dao-Iei, Z., Zhong, Z., and Xiao-qiang, G. “Intelligent Optimization-Based Production Planning and Simulation Analysis for Steelmaking and Continuous Casting Process”, Journal of Iron and Steel Research, International, 17(9), 19- 24, 30 (2010).
                        [11]      Witt, A., and Voss, S. “Application of a mathematical model to an intermediate- to long-term real-world steel production planning problem based on standard software”, European Journal of Industrial Engineering, 5 (1), 81- 100 (2011).
                        [12]      Wei, L., and Liang-liang, S. “Steel-Making and Continuous/Ingot Casting Scheduling of Mixed Charging Plan Based on Batch Splitting Policy”, Journal of iron and steel research, international, 19 (2), 17- 21 (2012).
                        [13]      Gui-rong Wang, Qi-qiang Li, Lu-hao Wang “An improved cross entropy algorithm for steelmaking- continuous casting production scheduling with complicated technological routes”, Journal of Central South University. 22 (8), 2998-3007 (2015).
                        [14]      Touil Achraf, Echchtabi Abdelwahed, Bellabdaoui Adil “A simulated annealing method to optimize the order of the sequences in continuous- casting”, International Journal of Mathematics and Computational Science. Vol. 1, No. 5, pp. 282- 287 (2015).
                        [15]      Haderaa H., Harjunkoskia I., Sanda G., Grossmannc I. E., Engell S. “Optimization of steel production scheduling with complex time-sensitive electricity cost”, Computers and Chemical Engineering 76, 117–136 (2015).
                        [16]      Nastasi G., Colla V. and Seppia M. D. “A Multi-Objective Coil Route Planning System for the Steelmaking Industry Based on Evolutionary Algorithms”, International Journal of Simulation Systems Science & Technologies 16, 61- 68 (2015).
                        [17]      Armellini D., Borzonea P., Ceschiab S., Gasperob L. D., and Schaerfb A. “Modeling and solving the steelmaking and casting scheduling problem”, International Transaction in Operation Research. 1–34 (2018).
                        [18]      Li Qing, Wang Xiuying, Zhang Xiaofeng “A Scheduling Method Based on NSGA2 for Steelmaking and Continuous Casting Production Process”, IFAC-Papers On Line, 51, 18, 174-179 (2018).
                        [19]      Peng K., Pan Q., Gao L., Zhang B., Pang X. “An Improved Artificial Bee Colony Algorithm for Real-World Hybrid Flowshop Rescheduling in Steelmaking-Refining Continuous Casting Process”. Computers and Industrial Engineering. https://doi.org/10.1016/j.cie.2018.05.056, (2018).
                        [20]      Jiang S., Zheng Z., Liu M. “A Preference-Inspired Multi-Objective Soft Scheduling Algorithm for the Practical Steelmaking-Continuous Casting Production”. Computers and Industrial Engineering, https://doi.org/10.1016/j.cie.2017.10.028, (2018).
                        [21]      Fazel Zarandi, M. H., Dorry F. “A Hybrid Fuzzy PSO Algorithm for Solving Steelmaking- Continuous Casting Scheduling Problem”, International Journal of Fuzzy System, 20(1):219– 235 (2018).
                        [22]      Rahal Said, Li Zukui, Papageorgiou Dimitri J. “Proactive and Reactive Scheduling of the Steelmaking and Continuous Casting Process through Adaptive Robust Optimization”, Computers and Chemical Engineering, https://doi.org/10.1016/j.compchemeng.2019.106658, (2019).
                        [23]      Cui Haijuan, Luo Xiaochuan, Wang Yuan “Scheduling of steelmaking-continuous casting process using deflected surrogate Lagrangian relaxation approach and DC algorithm”, Computers & Industrial Engineering, 140, 106271 (2020).
                        [24]      Long Jianyu, Sun Zhenzhong, Pardalos Panos M., Bai Yun, Zhang Shaohui, Li Chuan “A robust dynamic scheduling approach based on release time series forecasting for the steelmaking-continuous casting production”, Applied Soft Computing Journal, https://doi.org/10.1016/j.asoc.2020.106271, (2020).
                        [25]      Portmann, M.-C., Vignier, A., Dardilhac, D., and Dezalay, D. “Branch and Bound crossed with GA to solve hybrid flow shops”, European Journal of Operational Research, 107, 389- 400 (1998).
                        [26]      Akkan, C., and Karabat, S. “The two-machine flow shop total completion time problem: Improved lower bounds and a Branch and Bound algorithm”. European Journal of Operational Research, 159, 420- 429 (2004).
                        [27]      Moursli, O., and Pochet, Y. “A Branch and Bound algorithm for the hybrid flow shop”, International Journal of Production Economics, 64, 113- 125 (2000).
                        [28]      Haouari, M., Hidri, L., and Gharbi, A. “Optimal scheduling of a two-stage hybrid flow shop”, Mathematical Methods of Operations Research. 64, 107- 124 (2006).
                        [29]      Ng, C.T., Wang, J.-B., Cheng, T.C.E., and Liu, L.L. “A Branch and Bound algorithm for solving a two-machine flow shop problem with deteriorating jobs”, Computers & Operations Research, 37, 83- 90 (2010).
                        [30]      Ranjbar, M., Davari, M., and Leus, R. “Two Branch and Bound algorithms for the robust parallel machine scheduling problem”, Computers & Operations Research, 39, 1652- 1660 (2012).
                        [31]      Khoudi A., Berrichi A. “Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective Branch and Bound algorithm”, Operational Research, https://doi.org/10.1007/s12351-018-0384-3, (2018).
                        [32]      Tanaka Shunji, Tierney Kevin, Parreño-Torres Consuelo, Alvarez-Valdes Ramon, Ruiz Rubén “A Branch and Bound approach for large pre-marshalling problems”, European Journal of Operational Research, 278, 211– 225 (2019).
                        [33]      Bunel Rudy, Turkaslan Ilker, Torr Philip H.S., Kumar M. Pawan “Branch and Bound for Piecewise Linear Neural Network Verification”. Journal of Machine Learning Research, 21, 1-39 (2020).
                        [34]      Allahverdi, A., and Al-Anzi, F. S. “A Branch and Bound algorithm for three-machine flow shop scheduling problem to minimize total completion time with separate setup times”, European Journal of Operational Research, 169, 767- 780 (2006).
Advances in Industrial Engineering
Volume 53, Issue 4
October 2019
Pages 127-147

Files

Share

How to cite

Statistics