Skip to main content

Scheduling steel plates on a roller furnace

  • Conference paper
  • First Online:
Book cover Operations Research Proceedings 2011

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

We introduce a single machine scheduling problem arising in the heat treatment of steel plates. To the best of our knowledge, there is no study on this problem in the literature up to now. We refer to this problem as the Heat Treatment Furnace Scheduling Problem with Distance Constraints (HTFSPD) and propose a mixed integer linear program (MILP) formulation. Since the problem itself is NPhard and computational times for real world instances are too high, a genetic algorithm is developed in order to provide heuristic solutions. Computational results for some real data sets1 demonstrate the performance of the algorithm compared to the current solution method used in practice.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Baker, K.R., Trietsch, D.: Principles of Sequencing and Scheduling. JohnWiley & Sons, New York, (2009)

    Book  Google Scholar 

  2. Eiben, A., Smith, J.: Introduction to Evolutionary Computation. Springer, Berlin, (2003)

    Google Scholar 

  3. Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal Of Operational Research 207, 1–14 (2010) doi: 10.1016/j.ejor.2009.11.005

    Article  Google Scholar 

  4. Karaboga, D., Akay, B.: A survey: algorithms simulating bee swarm intelligence. Artificial Intelligence Review 31, 61–85 (2009) doi: 10.1007/s10462-009-9127-4

    Article  Google Scholar 

  5. Karci, A.: Imitation of Bee Reproduction as a Crossover Operator in Genetic Algorithms. Lecture Notes in Computer Science 3157, 1015-1016 (2004)

    Article  Google Scholar 

  6. Kelleg¨oz, T., Toklu, B., Wilson, J.: Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem. Applied Mathematics and Computation 199, 590-598 (2008)

    Google Scholar 

  7. Kon´e, O., Artigues, C., Lopez, P., Mongeau, M.: Event-based MILP models for resourceconstrained project scheduling problems. Computers & Operations Research 38, 3–13 (2011) doi: 10.1016/j.cor.2009.12.011

    Google Scholar 

  8. Pinedo, M.L.: Scheduling - Theory, Algorithms, and Systems (3rd edition). Springer, New York (2008)

    Google Scholar 

  9. Wang, X., Tang, L.: A simplified scatter search for a special single machine scheduling problem to minimize total weighted tardiness. CDC 2009, 6250–6255 (2009)

    Google Scholar 

  10. Zhang, G., Cai, X.,Wong, C.K.: Some results on resource constrained scheduling. IIE Transactions 36, 1–9 (2004) doi: 10.1080/07408170490257862

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eric Ebermann .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ebermann, E., Nickel, S. (2012). Scheduling steel plates on a roller furnace. In: Klatte, D., Lüthi, HJ., Schmedders, K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29210-1_62

Download citation

Publish with us

Policies and ethics