Skip to main content

An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing

  • Conference paper
Principles and Practice of Constraint Programming – CP 2007 (CP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4741))

Abstract

We present an overview of a system developed by IBM for generating short-term operations schedules for a large steel manufacturer. The problem addressed by the system was challenging due to the combination of detailed resource allocation and scheduling constraints and preferences, sequence dependent setup times, tight minimum and maximum inventory level constraints between processes, and constraints on the minimum and maximum levels of production by shift for each product group. We have developed a domain-specific decomposition based approach that uses mixed-integer programming to generate a high-level plan for production, and constraint programming to generate a schedule at fine level of time granularity taking into account detailed scheduling constraints and preferences. In this paper we give an overview of the problem domain and solution approach, and present a detailed description of the constraint programming part of the system. We also discuss the impact the system is having with the customer on their manufacturing operations.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baptiste, P., LePape, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. In: International Series in Operations Research and Management Science, vol. 39, Kluwer, Dordrecht (2001)

    Google Scholar 

  2. Beck, J.C., Davenport, A.J., Sitarski, E.M., Fox, M.S.: Texture-Based Heuristics for Scheduling Revisited. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI 1997), pp. 241–248. AAAI Press/MIT Press (1997)

    Google Scholar 

  3. Cheng, C.C., Smith, S.F.: Applying constraint satisfaction techniques to job shop scheduling. Annals of Operations Research, Special Volume on Scheduling: Theory and Practice 1 (1996)

    Google Scholar 

  4. Katriel, I., Van Hentenryck, P.: Maintaining Longest Paths in Cyclic Graphs. In: Proc. 11th International Conference on Principles and Practice of Constraint Programming, Springer, Heidelberg (2005)

    Google Scholar 

  5. Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results. Artificial Intelligence Journal 143(2), 151–188 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Davenport, A., Kalagnanam, J.: Scheduling steel production using mixed-integer programming and constraint programming. In: Proceedings of the 3rd Multidisciplinary International Scheduling Conference: Theory and Applications (2007)

    Google Scholar 

  7. Beck, J.C., Fox, M.S.: Scheduling Alternative Activities. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI 1999) (1999)

    Google Scholar 

  8. Kramer, L.A., Smith, S.F.: Maximizing Flexibility: A Retraction Heuristic for Over-subscribed Scheduling Problems. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003) (2003)

    Google Scholar 

  9. Focacci, F., Laborie, P., Nuijten, W.: Solving Scheduling Problems with Setup Times and Alternative Resources. In: Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling Systems (AIPS 2000), pp. 92–111 (2000)

    Google Scholar 

  10. Lee, H.S., Trumbo, M.: An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 1402–1411 (1997)

    Google Scholar 

  11. Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) Principles and Practice of Constraint Programming - CP 1998. LNCS, vol. 1520, Springer, Heidelberg (1998)

    Google Scholar 

  12. Smith, A.W., Smith, B.: Constraint Programming Approaches to a Scheduling Problem in Steelmaking. School of Computing Research Report 97.43, University of Leeds (September 1997)

    Google Scholar 

  13. http://www.cosytec.com/constraint_programming/cases_studies/steel_industry.htm

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christian Bessière

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Davenport, A., Kalagnanam, J., Reddy, C., Siegel, S., Hou, J. (2007). An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74970-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74969-1

  • Online ISBN: 978-3-540-74970-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics