Skip to main content

Integer and Constraint Programming for Batch Annealing Process Planning

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming (CP 2017)

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

  • 2017 Accesses

Abstract

We describe an optimization application in the context of steel manufacturing, to design and schedule batches for annealing furnaces. Our solution approach uses a two-phase decomposition. The first phase groups together orders into batches using a mixed-integer linear programming model. The second phase assigns the batches to furnaces and schedules them over time, using constraint programming. Our solution has been developed for operational use in two plants of a steel manufacturer in North America.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    We use the common shorthand [n] to denote the set \(\{1,\dots ,n\}\) for an integer n.

  2. 2.

    Recall that \(b'\) must be scheduled at least three days (4320 min) after b finishes.

References

  1. Baptiste, P., Le Pape, C., Nuijten, W., Scheduling, C.-B.: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)

    MATH  Google Scholar 

  2. Castro, P.M., Erdirik-Dogan, M., Grossmann, I.E.: Simultaneous batching and scheduling of single stage batch plants with parallel units. AIChE J. 54(1), 183–193 (2008)

    Article  Google Scholar 

  3. Harjunkoski, I., Grossmann, I.E.: A decomposition approach for the scheduling of a steel plant production. Comput. Chem. Eng. 25(11–12), 1647–1660 (2001)

    Article  Google Scholar 

  4. Liu, Q., Wanga, W., Zhanb, H., Wanga, Z., Liua, R.: Optimal scheduling method for a bell-type batch annealing shop and its application. Control Eng. Pract. 13(10), 1315–1325 (2005)

    Article  Google Scholar 

  5. Méndez, C.A., Cerdá, J., Grossmann, I.E., Harjunkoski, I., Fahl, M.: State-of-the-art review of optimization methods for short-term scheduling of batch processes. Comput. Chem. Eng. 30, 913–946 (2006)

    Article  Google Scholar 

  6. Moon, S., Hrymak, A.N.: Scheduling of the batch annealing process - deterministic case. Comput. Chem. Eng. 23(9), 1193–1208 (1999)

    Article  Google Scholar 

  7. Roelofs, M., Bisschop, J.J.: AIMMS 4.2: The Language Reference. AIMMS B.V. (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Willem-Jan van Hoeve .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

van Hoeve, WJ., Tayur, S. (2017). Integer and Constraint Programming for Batch Annealing Process Planning. In: Beck, J. (eds) Principles and Practice of Constraint Programming. CP 2017. Lecture Notes in Computer Science(), vol 10416. Springer, Cham. https://doi.org/10.1007/978-3-319-66158-2_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66158-2_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66157-5

  • Online ISBN: 978-3-319-66158-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics