Skip to main content
SpringerLink
Log in

Iterated Greedy Constraint Programming for Scheduling Steelmaking Continuous Casting

  • Conference paper
  • First Online:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13884))

  • 1024 Accesses

Abstract

We consider a steelmaking-continuous casting (SCC) scheduling problem in the steel industry, which is a variant of the hybrid flow shop scheduling problem subject to practical constraints. Recently, Hong et al. [Hong, J., Moon, K., Lee, K., Lee, K., Pinedo, M.L., International Journal of Production Research 60(2), 623-643 (2022)] developed an algorithm, called Iterated Greedy Matheuristic (IGM), in which a Mixed Integer Programming (MIP) model was proposed and its subproblems are iteratively solved to improve the solution. We propose a new constraint programming (CP) formulation for the SCC scheduling problem and develop an algorithm, called Iterated Greedy CP (IGC), which uses the framework of IGM but replaces the MIP model with our CP model. When we solve the CP subproblems iteratively, we also refine them by adding appropriate constraints, reducing the domains of the variables, and giving the variables hints derived from the current solution. From computational experiments in various settings, we show that IGC implemented with an open-source CP solver can be competitive with IGM running on a commercial MIP solver.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Abderrazzak, S., Hamid, A., Omar, S.: Adaptive large neighborhood search for the just-in-time job-shop scheduling problem. In: 2022 International Conference on Control, Automation and Diagnosis (ICCAD), pp. 1–6 (2022)

    Google Scholar 

  2. Beck, J.C., Feng, T., Watson, J.P.: Combining constraint programming and local search for job-shop scheduling. INFORMS J. Comput. 23(1), 1–14 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Carchrae, T., Beck, J.C.: Principles for the design of large neighborhood search. J. Math. Model. Algorithms 8(3), 245–270 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hong, J.: junetech/scc-process-scheduling-instances: 2021-07-23 version (2021). https://doi.org/10.5281/zenodo.5126007

  5. Hong, J., Moon, K., Lee, K., Lee, K., Pinedo, M.L.: An iterated greedy matheuristic for scheduling in steelmaking-continuous casting process. Int. J. Prod. Res. 60(2), 623–643 (2022)

    Article  Google Scholar 

  6. Malapert, A., Cambazard, H., Guéret, C., Jussien, N., Langevin, A., Rousseau, L.M.: An optimal constraint programming approach to the open-shop problem. INFORMS J. Comput. 24(2), 228–244 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Meng, L., Gao, K., Ren, Y., Zhang, B., Sang, H., Chaoyong, Z.: Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 71, 101058 (2022)

    Article  Google Scholar 

  8. Meng, L., Zhang, C., Ren, Y., Zhang, B., Lv, C.: Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput. Ind. Eng. 142, 106347 (2020)

    Article  Google Scholar 

  9. Missbauer, H., Hauber, W., Stadler, W.: A scheduling system for the steelmaking-continuous casting process. A case study from the steel-making industry. Int. J. Prod. Res. 47(15), 4147–4172 (2009)

    Google Scholar 

  10. 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 - Volume Three, Barcelona, Catalonia, Spain, pp. 1997–2002. AAAI Press (2011)

    Google Scholar 

  11. Pan, Q.K., Wang, L., Mao, K., Zhao, J., Zhang, M.: An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process. IEEE Trans. Autom. Sci. Eng. 10(2), 307–322 (2013)

    Article  Google Scholar 

  12. Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 399–419. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5_13

    Chapter  Google Scholar 

  13. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-49481-2_30

    Chapter  Google Scholar 

  14. Tang, L., Luh, P.B., Liu, J., Fang, L.: Steel-making process scheduling using Lagrangian relaxation. Int. J. Prod. Res. 40(1), 55–70 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pohang University of Science and Technology, Pohang, South Korea

    Dongyun Kim, Yeonjun Choi, Kyungduk Moon, Myungho Lee & Kangbok Lee

  2. Stern School of Business, New York University, New York, NY, USA

    Michael L. Pinedo

Authors
  1. Dongyun Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yeonjun Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kyungduk Moon
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Myungho Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kangbok Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Michael L. Pinedo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kangbok Lee .

Editor information

Editors and Affiliations

  1. Department of Management, University of Toronto Scarborough and Rotman School of Management, University of Toronto, Toronto, ON, Canada

    Andre A. Cire

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kim, D., Choi, Y., Moon, K., Lee, M., Lee, K., Pinedo, M.L. (2023). Iterated Greedy Constraint Programming for Scheduling Steelmaking Continuous Casting. In: Cire, A.A. (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2023. Lecture Notes in Computer Science, vol 13884. Springer, Cham. https://doi.org/10.1007/978-3-031-33271-5_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-33271-5_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-33270-8

  • Online ISBN: 978-3-031-33271-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation