Scheduling steel plates on a roller furnace

  • Eric Ebermann
  • Stefan Nickel
Conference paper
Part of the Operations Research Proceedings book series (ORP)


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.


Mixed Integer Linear Program Mixed Integer Linear Program Model Single Machine Schedule Problem Total Weighted Tardiness Mixed Integer Linear Program Formulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baker, K.R., Trietsch, D.: Principles of Sequencing and Scheduling. JohnWiley & Sons, New York, (2009)CrossRefGoogle Scholar
  2. 2.
    Eiben, A., Smith, J.: Introduction to Evolutionary Computation. Springer, Berlin, (2003)Google Scholar
  3. 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.005CrossRefGoogle Scholar
  4. 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-4CrossRefGoogle Scholar
  5. 5.
    Karci, A.: Imitation of Bee Reproduction as a Crossover Operator in Genetic Algorithms. Lecture Notes in Computer Science 3157, 1015-1016 (2004)CrossRefGoogle Scholar
  6. 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. 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.011Google Scholar
  8. 8.
    Pinedo, M.L.: Scheduling - Theory, Algorithms, and Systems (3rd edition). Springer, New York (2008)Google Scholar
  9. 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. 10.
    Zhang, G., Cai, X.,Wong, C.K.: Some results on resource constrained scheduling. IIE Transactions 36, 1–9 (2004) doi:  10.1080/07408170490257862 CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of Operations Research (IOR)Karlsruhe Institute of Technology (KIT)KarlsruheGermany

Personalised recommendations