Advertisement

An Improved Self-adaptive Genetic Algorithm for Scheduling Steel-Making Continuous Casting Production

  • Ling Li
  • Qiuhua Tang
  • Peng Zheng
  • Liping Zhang
  • C. A. Floudas
Conference paper

Abstract

The steel-making continuous casting scheduling problem holds more constraints than flow shop in no-idle machine constraint, multiple buffers and batch scheduling, resulting in strong NP-hardness. Its mathematical programming model is first established based on unit-specific event-point continuous-time representation. Then a novel improved self-adaptive genetic algorithm (SAGA) is proposed to optimize the sequence among casts with the objective of reducing the total idle times on all machines and minimizing the make-span. In SAGA, the probabilities of crossover and mutation rate are rectified exquisitely and automatically so as to avoid being trapped in local optima and neighbourhood-based mutation operation is adopted to improve the diversity. Experimental comparisons with GAMS/CPLEX and other two state-of-art algorithms demonstrate the effectiveness and efficiency of SAGA in solving the large-size problems.

Keywords

Flow shop scheduling Steel-making continuous casting Self-adaptive genetic algorithm 

Notes

Acknowledgments

We express our deepest gratitude to the National Science Foundation of China under grants of 51275366 and 51305311 and the Specialized Research Fund for the Doctoral Program of Higher Education of China (20134219110002). The authors also thank suggestions and comments from the anonymous referees to improve this paper.

References

  1. 1.
    Li J, Xiao X, Tang QH, Floudas CA (2012) Production scheduling of a large-scale steelmaking continuous casting process via unit-specific event-based continuous-time models: short-term and medium-term scheduling. Ind Eng Chem Res 51(21):7300–7319CrossRefGoogle Scholar
  2. 2.
    Gao KZ, Pan QK, Suganthan PN, Li JQ (2013) Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization. Int J Adv Manuf Technol 66(9–12):1563–1572CrossRefGoogle Scholar
  3. 3.
    Tang LX, Liu GL (2007) A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan iron and steel complex. Eur J Oper Res 182(3):1453–1468zbMATHCrossRefGoogle Scholar
  4. 4.
    Pacciarelli Dario, Pranzo Marco (2004) Production scheduling in a steelmaking-continuous casting plant. Comput Chem Eng 28(12):2823–2835CrossRefGoogle Scholar
  5. 5.
    Zhao Y, Jia FY, Wang GS, Wang LJ (2011) A hybrid tabu search for steelmaking-continuous casting production scheduling problem. In: International symposium on advanced control of industrial processes, ADCONIP, pp 535–540Google Scholar
  6. 6.
    Tang QH, Chen WM, Jiang GZ (2008) Steelmaking-continuous casting production scheduling model research based on JIT. J Wuhan Univ Sci Technol (Nat Sci Ed) 31(1):78–82Google Scholar
  7. 7.
    Srinivas M, Patnaik LM (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans Syst Man Cybern 24(4):656–667CrossRefGoogle Scholar

Copyright information

© Atlantis Press and the author(s) 2016

Authors and Affiliations

  • Ling Li
    • 1
  • Qiuhua Tang
    • 1
  • Peng Zheng
    • 1
  • Liping Zhang
    • 1
  • C. A. Floudas
    • 2
  1. 1.Industrial Engineering DepartmentWuhan University of Science and TechnologyWuhanChina
  2. 2.Department of Chemical and Biological EngineeringPrinceton UniversityPrincetonUSA

Personalised recommendations