Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A GRASP heuristic for the hot strip mill scheduling problem under consideration of energy consumption

  • Original Paper
  • Published:
Journal of Business Economics Aims and scope Submit manuscript

Abstract

Hot strip mill rolling is an energy intensive production process in the steel industry. It converts steel slabs at high temperatures into steel strips. In this paper we address the related planning problem, i.e. the hot strip mill scheduling problem. The task is to determine the production sequence of production orders within a schedule. The involved energy consumption for heating individual slabs is explicitly considered in a new mixed integer problem formulation. The model is solved using a greedy randomized adaptive search procedure. In a numerical case study based on real world data the applicability and performance of the proposed heuristic is analyzed. The solution approach is able to find optimal solutions for small problem instances. Moreover, it solves industry size problem instances within reasonable time and outperforms the rule based planning approach prevalent in praxis.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. The figures are based on a typical hot strip production of 4 million tons causing 1815 kg of CO2 emissions per ton produced, Birat et al. (2009).

References

  • Birat J, Lorrain J, de Lassat Y (2009) The “CO2 Tool”: CO2 emissions & energy consumption of existing & breakthrough steelmaking routes. Rev Met Paris 106(9):325–336. doi:10.1051/metal/2009060

    Article  Google Scholar 

  • Chen X, Wan W, Xu X (1998) Modeling rolling batch planning as vehicle routing problem with time windows. Comput Oper Res 25(12):1127–1136

    Article  Google Scholar 

  • Chen WH, Chung YC, Liu JL (2005) Analysis on energy consumption and performance of reheating furnaces in a hot strip mill. Int Commun Heat Mass Transfer 32(5):695–706. doi:10.1016/j.icheatmasstransfer.2004.10.019

    Article  Google Scholar 

  • Chen Y, Lu Y, Ge M, Yang G, Pan C (2012) Development of hybrid evolutionary algorithms for production scheduling of hot strip mill. Comput Oper Res 39(2):339–349

    Article  Google Scholar 

  • Feo TA, Sarathy K, McGahan J (1996) A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties. Comput Oper Res 23(9):881–895. doi:10.1016/0305-0548(95)00084-4

    Article  Google Scholar 

  • Gupta SR, Smith JS (2006) Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur J Oper Res 175(2):722–739. doi:10.1016/j.ejor.2005.05.018

    Article  Google Scholar 

  • Jia S, Zhu J, Yang G, Yi J, Du B (2012) A decomposition-based hierarchical optimization algorithm for hot rolling batch scheduling problem. Int J Adv Manuf Tech 61(5):487–501. doi:10.1007/s00170-011-3749-9

    Article  Google Scholar 

  • Kosiba ED, Wright JR, Cobbs AE (1992) Discrete event sequencing as a traveling salesman problem. Comput Ind 19(3):317–327

    Article  Google Scholar 

  • Liu S (2010) Model and algorithm for hot rolling batch planning in steel plants. Int J Inf Manag Sci 21:247–263

    Google Scholar 

  • Lopez L, Carter MW, Gendreau M (1998) The hot strip mill production scheduling problem: a tabu search approach. Eur J Oper Res 106:317–335

    Article  Google Scholar 

  • Neumann K, Morlock M (2002) Operations-Research, 2nd edn. Hanser, München, Wien

    Google Scholar 

  • Ning S, Wang W (2006) Multi-objective Optimization Model and Algorithm for Hot Rolling Lot Planning. In: Institute of Electrical and Electronics Engineers (ed) 6th world congress on intelligent control and automation, vol 2. Curran Associates Inc, Dalian, pp 7390–7394

  • Resende MG, Ribeiro CC (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Norwell, pp 219–249

    Google Scholar 

  • Tang L, Liu J, Rong A, Yang Z (2000) A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex. Eur J Oper Res 124(2):267–282

    Article  Google Scholar 

  • Tang L, Liu J, Rong A, Yang Z (2001) A review of planning and scheduling systems and methods for integrated steel production. Eur J Oper Res 133(1):1–20

    Article  Google Scholar 

  • Tu N, Luo X, Chai T (2011) Two-stage method for solving large-scale hot rolling planning problem in steel production. In: International Federation of Automatic Control (ed) Preprints of the 18th IFAC world congress, vol 18, pp 12120–12125

  • Wang X, Tang L (2008) Integration of batching and scheduling for hot rolling production in the steel industry. Int J Adv Manuf Tech 36(5):431–441

    Article  Google Scholar 

  • Wichmann MG, Volling T, Spengler TS (2014) A GRASP heuristic for slab scheduling at continuous casters. OR Spectrum 36(3):693–722. doi:10.1007/s00291-013-0330-y

    Article  Google Scholar 

  • Xiong C, Qidi W (2002) Formulating the steel scheduling problem as a TSPTW. In: East China University of Science and Technology (ed) Proceedings of the 4th world congress on intelligent control and automation, vol 3. East China University of Science and Technology, Shanghai, pp 1744–1748

  • Yadollahpour M, Bijari M, Kavosh S, Mahnam M (2009) Guided local search algorithm for hot strip mill scheduling problem with considering hot charge rolling. Int J Adv Manuf Tech 45(11):1215–1231

    Article  Google Scholar 

  • Zhao J, Wang W, Liu Q, Wang Z, Shi P (2009) A two-stage scheduling method for hot rolling and its application. Control Eng Pract 17(6):629–641

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Karen Puttkammer.

Appendix

Appendix

The formulated problem contains two kinds of nonlinearities. First, products of binary and continuous decision variables are embedded in constraints (17), (24) and (25). Second, absolute values are used in constraints (15), (22), and (23). In the following a linearization approach is given for both kinds of nonlinearities.

First, the product of a binary variable a and a continuous variable b is regarded. It conveys the following statement: If a = 1 the product has the value b. If a = 0 the product has the value 0. The term a · b can be linearized by introducing an additional continuous variable x that is restricted by four linear constraints:

$$\left( {a - 1} \right) \cdot M + b \le x$$
(35)
$$x \le - \left( {a - 1} \right) \cdot M + b$$
(36)
$$- a \cdot M \le x$$
(37)
$$x \le a \cdot M$$
(38)

On the one hand the constraints (35) and (36) demand that if a = 1 then x = b. If a = 0 these constraints are not binding. On the other hand the constraints (37) and (38) demand that if a = 0 then x = 0. If a = 1 these constraints are not binding. In consequence, the term a · b conveys the same statement as the new variable x with the constraints (35) to (38), and thus, can be replaced by the latter.

Considering the model in Sect. 3.3, the term x hj  · [∑  k l=j  ∑  n i=1 x il  · Swd hi  · lg i ] in constraint (17) can be interpreted as product of the binary variable x hj and the continuous variable ∑  k l=j  ∑  n i=1 x il  · Swd hi  · lg i . The term is replaced by the continuous variable u hjk which leads to the following reformulation:

$$- \mathop \sum \limits_{l = j + 1}^{k} \left( {\alpha_{l} + \beta_{l} } \right) \cdot M + \mathop \sum \limits_{h = 1}^{n} u_{hjk} \le lg_{Swd}^{max}\quad \quad \forall j, k = 1 \ldots n, j < k$$
(39)
$$(x_{hj} - 1) \cdot M + \left[ {\mathop \sum \limits_{l = j}^{k} \mathop \sum \limits_{i = 1}^{n} x_{il} \cdot Swd_{hi} \cdot lg_{i} } \right] \le u_{hjk}\quad \quad \forall h,j,k = 1 \ldots n, j < k$$
(40)
$$u_{hjk} \le - (x_{hj} - 1) \cdot M + \left[ {\mathop \sum \limits_{l = j}^{k} \mathop \sum \limits_{i = 1}^{n} x_{il} \cdot Swd_{hi} \cdot lg_{i} } \right]\quad \quad \forall h,j,k = 1 \ldots n, j < k$$
(41)
$$- x_{hj} \cdot M \le u_{hjk}\quad \quad \forall h,j,k = 1 \ldots n, j < k$$
(42)
$$u_{hjk} \le x_{hj} \cdot M\quad \quad \forall h,j,k = 1 \ldots n, j < k$$
(43)

The same approach is applicable to constraints (24) and (25).

Second, the linearization of absolute values is presented by regarding the term |a| ≤ b. It says that a is bounded by − b ≤ a ≤ b. The same statement is conveyed by the linear constraints (44) and (45)

$$a \le b$$
(44)
$$- b \le a$$
(45)

Considering the model in Sect. 3.3, the according transformation of constraint (22) leads to the constraints (46) and (47). The same approach is applicable to constraints (15) and (23).

$$\mathop \sum \limits_{i = 1}^{n} x_{ij} {\cdot}hd_{i} - \mathop \sum \limits_{i = 1}^{n} x_{i,j - 1} {\cdot}hd_{i} \le \Delta hd^{max} + y_{j} \cdot M\quad \quad \forall j = 2 \ldots n$$
(46)
$$- \left( {\Delta hd^{max} + y_{j} \cdot M} \right) \le \mathop \sum \limits_{i = 1}^{n} x_{ij} {\cdot}hd_{i} - \mathop \sum \limits_{i = 1}^{n} x_{i,j - 1} {\cdot}hd_{i}\quad \quad \forall j = 2 \ldots n$$
(47)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Puttkammer, K., Wichmann, M.G. & Spengler, T.S. A GRASP heuristic for the hot strip mill scheduling problem under consideration of energy consumption. J Bus Econ 86, 537–573 (2016). https://doi.org/10.1007/s11573-015-0783-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11573-015-0783-3

Keywords

JEL Classification