Abstract
This paper studies a real-world hybrid flow shop problem arising from the steelmaking continuous casting process, which is the bottleneck of the iron and steel production. There are a variety of features to be taken into account, in particular, the batch constraints and the variable processing times in the last stages. Based on a time-index formulation and machine capacity relaxation, three Lagrangian relaxation (LR) approaches are presented to address this scheduling problem. The three LR approaches decompose the relaxed problem into job-level problems, batch-level problems, and machine-level problems, respectively. These subproblems are solved based on polynomial dynamic programming algorithms. An efficient subgradient algorithm solves the corresponding Lagrangian dual (LD) problems with global convergence. Computational results and comparisons demonstrate that the approach adopting job-level decomposition could get the nearest optimal scheduling within acceptable time among the three approaches and is suitable for making static scheduling which pursuits optimization quality rather than calculation time. The approach adopting machine-level decomposition could get acceptable optimal results in the shortest time and is the best choice for making rescheduling which requires the quick response for the dynamic disturbances.
Similar content being viewed by others
References
Bellabdaoui A, Teghem J (2006) A mixed-integer linear programming model for the continuous casting planning. Int J Prod Econ 104(2):260–270
Atighehchian A, Bijari M, Tarkesh H (2009) A novel hybrid algorithm for scheduling steelmaking continuous casting production. Comput Oper Res 36:2450–2461
Pan Q-K, Wang L, Mao K, Zhao J-H, Zhang M (2013) An effective artificial bee colony algorithm for a real-world hybrid flow shop problem in steelmaking process. IEEE Trans Autom Sci Eng 10:307–322
Pacciarelli D, Pranzo M (2004) Production scheduling in a steelmaking-continuous casting plant. Comput Chem Eng 28:2823–2835
Kumar V, Kumar S, Chan FTS, Tiwari MK (2006) Auction-based approach to resolve the scheduling problem in the steelmaking process. Int J Prod Res 44:1503–1522
Missbauer H, Hauberb W, Stadler W (2009) A scheduling system for the steelmaking-continuous casting process: a case study from the steelmaking industry. Int J Prod Res 47(15):4147–4172
Tang LX, Luh PB, Liu JY, Fang L (2002) Steelmaking process scheduling using Lagrangian relaxation. Int J Prod Res 40(1):55–70
Mao K, Pan Q, Pang X and Chai T (2013) A novel Lagrangian relaxation approach for the hybrid flow shop scheduling problem in a steelmaking-continuous casting process. Eur J Oper Res. in print
Pinedo M (2012) Scheduling: theory, algorithms, and systems, 4th edn. Prentice-Hall, Englewood Cliffs
Neron E, Baptiste P, Gupta JND (2001) Solving hybrid flow shop problem using energetic reasoning and global operations. OMEGA Int J Manag Sci 29:501–511
Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169:781–800
Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Scientific, Massachusetts
Chen H, Chu C, Proth JM (1998) An improvement of the Lagrangian relaxation approach for job shop scheduling: a dynamic programming method. IEEE Trans Robot Autom 14:786–95
Tang L, Xuan H, Liu J (2007) Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling. Comput Oper Res 34:2625–36
Luh PB, Hoitomt JD (1993) Scheduling of manufacturing systems using the Lagrangian relaxation technique. IEEE Trans Autom Control 38:1066–1079
Chen H, Luh PB (2003) An alternative framework to Lagrangian relaxation approach for job shop scheduling. Eur J Oper Res 149:499–512
Nishi T, Isoya Y, Inuiguchi M (2009) An integrated column generation and lagrangian relaxation for flow shop scheduling problems, Proceedings of the 2009 I.E. Trans. Syst. Man Cybern. 209–304
Baptiste P, Flamini M, Sourd F (2008) Lagrangian bounds for just-in-time job-shop scheduling. Comput Oper Res 35:905–915
Nishi T, Hiranaka Y, Inuiguchi M (2010) Lagrangian relaxation with cut generation for hybrid flow shop scheduling problems to minimize the total weighted tardiness. Comput Oper Res 37:189–198
Xuan H, Tang L (2007) Scheduling a hybrid flow shop with batch production at the last stage. Comput Oper Res 34:2178–2733
Sun Liang-liang, Chai Tian-you, Luh Peter B (2011) Scheduling of steel-making and continuous casting system using the surrogate subgradient algorithm for Lagrangian relaxation. Conference of Automation Science and Engineering, Toronto, Canada
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sun, L., Yu, S. Scheduling a real-world hybrid flow shop with variable processing times using Lagrangian relaxation. Int J Adv Manuf Technol 78, 1961–1970 (2015). https://doi.org/10.1007/s00170-014-6754-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-014-6754-y