Abstract
This study investigates the hot strip mill scheduling problem which is one of the most important planning problems in the steel industry. The problem is formulated using the prize collecting vehicle routing problem. The new proposed formulation considers more details and more realistic constraints than those used in previous studies. The hot charge technique leads to considerable savings in energy and other benefits in the process of steel production. In our proposed formulation, the necessary provisions required for obtaining an initial level of hot charge have been taken into consideration. A search algorithm has been developed that consists of three major phases including separation of slabs that can be scheduled, generation of an initial solution, and improvement of the solution. Generation of the initial solution is accomplished using a greedy constraint satisfaction algorithm and solution improvement through a guided local search. Proposed model and search algorithm have been tested on random and collected instances from practical production data in Mobarakeh Steel Complex. The experimental results show the high accuracy and efficiency of the proposed model and search algorithm.
Similar content being viewed by others
References
Tang L, Liu J, Rong A, Yang Z (2001) A review of planning and scheduling systems and methods for integrated steel production. Eur J Oper Res 133:1–20. doi:10.1016/S0377-2217(00)00240-X
Tang LX, Wang XP (2005) Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem. Int J Adv Manuf Technol 29:1246–1258. doi:10.1007/s00170-005-0014-0
Wang XP, Tang LX (2008) Integration of batching and scheduling for hot rolling production in the steel industry. Int J Adv Manuf Technol 36:431–441. doi:10.1007/s00170-006-0857-z
Kosiba ED, Wright JR, Cobbs AE (1992) Discrete event sequencing as a travelling salesman problem. Comput Ind 19:317–327. doi:10.1016/0166-3615(92)90069-Y
Lopez L, Carter MW, Gendreau M (1998) The hot strip mill production scheduling problem: a tabu search approach. Eur J Oper Res 106:317–335. doi:10.1016/S0377-2217(97)00277-4
Tang LX, Liu JY, Rong A, Yang Z (2000) Multiple travelling salesman problem model for hot scheduling in Shanghai Baoshan Iron & Steel Complex. Eur J Oper Res 124:267–282. doi:10.1016/S0377-2217(99)00380-X
Cowling P (1995) Optimization in steel hot rolling. Optimization in industry. Wiley, Chichester, England
Cowling P (2003) A flexible decision support system for steel hot rolling mill scheduling. Comput Ind 45:307–321. doi:10.1016/S0360-8352(03)00038-X
Wright JR, Houck MH (1985) An application of systems modeling in steel production scheduling. Engineering Software IV. Proceedings of the 4th International Conference. Kensington Exhibition Center, London, England, vol 15, pp 127–140
Balas E, Martin C (1991) Combinatorial optimization in steel rolling. In: The DIMACS/RUTCOR Workshop on Combinatorial Optimization in Science and Technology, Rutgers University, New Brunswick, NJ
Laporte G (2007) What you should know about the vehicle routing problem. Nav Res Logist 54:810–820
Monden Y (1998) Toyota production system, an integrated approach to just-in-time, 3rd edn. Engineering & Management Press, Norcross, GA
Voudouris C, Tsang E (1996) Partial constraint satisfaction problems and guided local search. Proceedings of Second International Conference on Practical Application of Constraint Technology (PACT’96), pp 337–356
Kytojoki J, Nuortio T, Braysy O, Gendreau M (2007) An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput Oper Res 34:2743–2757. doi:10.1016/j.cor.2005.10.010
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yadollahpour, M.R., Bijari, M., Kavosh, S. et al. Guided local search algorithm for hot strip mill scheduling problem with considering hot charge rolling. Int J Adv Manuf Technol 45, 1215 (2009). https://doi.org/10.1007/s00170-009-2058-z
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00170-009-2058-z