Abstract
Although the Steel Mill Slab problem (prob 38 of CSPLib) has already been studied by the CP community, this approach is unfortunately not used anymore by steel producers since last century. Continuous casting is preferred instead, allowing higher throughput and better steel quality. This paper presents a CP model related to scheduling of operations for steel making with continuous casting. Activities considered range from the extraction of iron in the furnace to its casting in continuous casters. We describe the problem, detail a CP scheduling model that is finally used to solve real-life instances of some of the PSI Metals’ customers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Atighehchian, A., Bijari, M., Tarkesh, H.: A novel hybrid algorithm for scheduling steel-making continuous casting production. Computers & Operations Research 36(8), 2450–2461 (2009)
Baptiste, P., Pape, C.L., Nuijten, W.: Constraint-based scheduling: applying constraint programming to scheduling problems, vol. 39. Springer (2001)
Carchrae, T., Beck, C.: Principles for the design of large neighborhood search. Journal of Mathematical Modelling and Algorithms 8(3), 245–270 (2009)
Frisch, A.M., Miguel, I., Walsh, T.: Modelling a steel mill slab design problem. In: Proceedings of the IJCAI 2001 Workshop on Modelling and Solving Problems with Constraints, Citeseer (2001)
Gargani, A., Refalo, P.: An efficient model and strategy for the steel mill slab design problem. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 77–89. Springer, Heidelberg (2007)
Godard, D., Laborie, P., Nuijten, W.: Randomized large neighborhood search for cumulative scheduling. In: ICAPS, vol. 5, pp. 81–89 (2005)
Heinz, S., Schlechte, T., Stephan, R., Winkler, M.: Solving steel mill slab design problems. Constraints 17(1), 39–50 (2012)
Laborie, P., Godard, D.: Self-adapting large neighborhood search: Application to single-mode scheduling problems. In: Proceedings MISTA 2007, Paris, pp. 276–284 (2007)
Pape, C.L., Couronné, P., Vergamini, D., Gosselin, V.: Time-versus-capacity compromises in project scheduling. In: Proceedings of the Thirteenth Workshop of the UK Planning Special Interest Group (1994)
Letort, A., Carlsson, M., Beldiceanu, N.: A synchronized sweep algorithm for the k-dimensional cumulative constraint. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 144–159. Springer, Heidelberg (2013)
Monette, J.-N., Deville, Y., Hentenryck, P.V.: Just-in-time scheduling with constraint programming. In: ICAPS (2009)
Pacino, D., Van Hentenryck, P.: Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, vol. 3, pp. 1997–2002. AAAI Press (2011)
Schaus, P.: Variable objective large neighborhood search: A practical approach to solve over-constrained problems. In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2013) (2013)
Schaus, P., Hentenryck, P.V., Monette, J.-N., Coffrin, C., Michel, L., Deville, Y.: Solving steel mill slab problems with constraint-based techniques: Cp, lns, and cbls. Constraints 16(2), 125–147 (2011)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)
steel.org. The online resource for steel (accessed: April 20, 2014)
Tang, L., Luh, P.B., Liu, J., Fang, L.: Steel-making process scheduling using lagrangian relaxation. International Journal of Production Research 40(1), 55–70 (2002)
Vilım, P.: Global constraints in scheduling. PhD thesis, PhD thesis, Charles University in Prague, Faculty of Mathematics and Physics, Department of Theoretical Computer Science and Mathematical Logic, KTIML MFF, Universita Karlova, Malostranské námestı 2/25, 118 00 Praha 1, Czech Republic (2007)
Wikipedia. Continuous casting — Wikipedia, the free encyclopedia (2013) (accessed: April 20, 2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Gay, S., Schaus, P., De Smedt, V. (2014). Continuous Casting Scheduling with Constraint Programming. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_59
Download citation
DOI: https://doi.org/10.1007/978-3-319-10428-7_59
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10427-0
Online ISBN: 978-3-319-10428-7
eBook Packages: Computer ScienceComputer Science (R0)