A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry

被引:66
|
作者
Jiang, Shenglong [1 ]
Liu, Min [1 ]
Hao, Jinghua [1 ]
Qian, Wangping [2 ]
机构
[1] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
[2] Jiangsu Shagang Grp Co Ltd, Ctr Comp Applicat, Zhangjiagang 215625, Peoples R China
基金
中国国家自然科学基金;
关键词
Steelmaking; Hybrid flow shop; Scheduling; DE; VNDS; CONTINUOUS-CASTING PRODUCTION; DIFFERENTIAL EVOLUTION ALGORITHM; OF-THE-ART; PROGRAMMING MODEL; TOTAL TARDINESS; MINIMIZE; MACHINE; SYSTEM; EARLINESS;
D O I
10.1016/j.cie.2015.06.002
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A steelmaking-continuous casting (SCC) scheduling problem is an example of complex hybrid flow shop scheduling problem (HFSSP) with a strong industrial background. This paper investigates the SCC scheduling problem that involves controllable processing times (CPT) with multiple objectives concerning the total waiting time, earliness/tardiness and adjusting cost. The SCC scheduling problem with CPT is seldom discussed in the existing literature. This study is motivated by the practical situation of a large integrated steel company in which the just-in-time am and cost-cutting production strategy have become a significant concern. To address this complex HFSSP, the scheduling problem is decomposed into two subproblems: a parallel machine scheduling problem (PMSP) in the last stage and an HFSSP in the upstream stages. First, a hybrid differential evolution (HDE) algorithm combined with a variable neighborhood decomposition search (VNDS) is proposed for the former subproblem. Second, an iterative backward list scheduling (IBLS) algorithm is presented to solve the latter subproblem. The effectiveness of this bi-layer optimization approach is verified by computational experiments on well-designed and real-world scheduling instances. This study provides a new perspective on modeling and solving practical SCC scheduling problems. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:518 / 531
页数:14
相关论文
共 50 条
  • [1] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    LAFON Pascal
    Science China(Technological Sciences), 2011, (05) : 1240 - 1248
  • [2] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    Niu GangGang
    Sun ShuDong
    Lafon, Pascal
    Yang HongAn
    SCIENCE CHINA-TECHNOLOGICAL SCIENCES, 2011, 54 (05) : 1240 - 1248
  • [3] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    LAFON Pascal
    Science China(Technological Sciences), 2011, 54 (05) : 1240 - 1248
  • [4] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    GangGang Niu
    ShuDong Sun
    Pascal Lafon
    HongAn Yang
    Science China Technological Sciences, 2011, 54 : 1240 - 1248
  • [5] Hybrid Flow Shop with Setup Times Scheduling Problem
    Jemmali, Mahdi
    Hidri, Lotfi
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2023, 44 (01): : 563 - 577
  • [6] A 2-MACHINE FLOW-SHOP SCHEDULING PROBLEM WITH CONTROLLABLE JOB PROCESSING TIMES
    NOWICKI, E
    ZDRZALKA, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 34 (02) : 208 - 220
  • [7] Flow-line scheduling problem with controllable processing times
    Karabati, Selcuk
    Kouvelis, Panagiotis
    IIE Transactions (Institute of Industrial Engineers), 1997, 29 (01): : 1 - 14
  • [8] Flow-line scheduling problem with controllable processing times
    Karabati, S
    Kouvelis, P
    IIE TRANSACTIONS, 1997, 29 (01) : 1 - 14
  • [9] An energy-efficient hybrid flow shop scheduling problem in steelmaking plants
    Lian, Xiaoyuan
    Zheng, Zhong
    Wang, Cheng
    Gao, Xiaoqiang
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 162
  • [10] MILP modeling and optimization of multi-objective flexible job shop scheduling problem with controllable processing times
    Meng, Leilei
    Zhang, Chaoyong
    Zhang, Biao
    Gao, Kaizhou
    Ren, Yaping
    Sang, Hongyan
    SWARM AND EVOLUTIONARY COMPUTATION, 2023, 82