Continuous Casting Scheduling with Constraint Programming

1. 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)

   Article  MATH  Google Scholar 

2. Baptiste, P., Pape, C.L., Nuijten, W.: Constraint-based scheduling: applying constraint programming to scheduling problems, vol. 39. Springer (2001)

   Google Scholar 

3. Carchrae, T., Beck, C.: Principles for the design of large neighborhood search. Journal of Mathematical Modelling and Algorithms 8(3), 245–270 (2009)

   Article  MATH  MathSciNet  Google Scholar 

4. 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)

   Google Scholar 

5. 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)

   Chapter  Google Scholar 

6. Godard, D., Laborie, P., Nuijten, W.: Randomized large neighborhood search for cumulative scheduling. In: ICAPS, vol. 5, pp. 81–89 (2005)

   Google Scholar 

7. Heinz, S., Schlechte, T., Stephan, R., Winkler, M.: Solving steel mill slab design problems. Constraints 17(1), 39–50 (2012)

   Article  MathSciNet  Google Scholar 

8. Laborie, P., Godard, D.: Self-adapting large neighborhood search: Application to single-mode scheduling problems. In: Proceedings MISTA 2007, Paris, pp. 276–284 (2007)

   Google Scholar 

9. 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)

   Google Scholar 

10. 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)

    Chapter  Google Scholar 

11. Monette, J.-N., Deville, Y., Hentenryck, P.V.: Just-in-time scheduling with constraint programming. In: ICAPS (2009)

    Google Scholar 

12. 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)

    Google Scholar 

13. 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)

    Google Scholar 

14. 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)

    Article  MathSciNet  Google Scholar 

15. 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)

    Chapter  Google Scholar 

16. steel.org. The online resource for steel (accessed: April 20, 2014)

    Google Scholar 

17. 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)

    Article  MATH  Google Scholar 

18. 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)

    Google Scholar 

19. Wikipedia. Continuous casting — Wikipedia, the free encyclopedia (2013) (accessed: April 20, 2014)

    Google Scholar 

Download references