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 条
  • [41] SIMULATION-BASED OPTIMIZATION FOR SOLVING A HYBRID FLOW SHOP SCHEDULING PROBLEM
    Aurich, Paul
    Nahhas, Abdulrahman
    Reggelin, Tobias
    Tolujew, Juri
    2016 WINTER SIMULATION CONFERENCE (WSC), 2016, : 2809 - 2819
  • [42] A Hybrid Particle Swarm Optimization Method for Permutation Flow Shop Scheduling Problem
    Wang, Lin
    Qu, Jianhua
    Zheng, Yuyan
    HUMAN CENTERED COMPUTING, HCC 2014, 2015, 8944 : 465 - 476
  • [43] Improved grey wolf optimization for solving hybrid flow shop scheduling problem
    Shi W.
    Song C.
    Song, Cunli (scunli@163.com), 1600, CIMS (27): : 3196 - 3208
  • [44] Optimization Solution to Lot Sizing and Scheduling Problem in Hybrid Flow-shop
    Song Fugen
    Lei Dayang
    2012 FIFTH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID 2012), VOL 2, 2012, : 231 - 235
  • [45] An integrated ant colony optimization algorithm for the hybrid flow shop scheduling problem
    Khalouli, Safa
    Ghedjati, Fatima
    Hamzaoui, Abdelaziz
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 554 - 559
  • [46] Solving the planning and scheduling problem simultaneously in a hospital with a bi-layer discrete particle swarm optimization
    Wu, Xiuli
    Shen, Xianli
    Zhang, Linjuan
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2019, 16 (02) : 831 - 861
  • [47] A hybrid particle swarm optimization approach for the job-shop scheduling problem
    Xia, Wei-Jun
    Wu, Zhi-Ming
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 29 (3-4): : 360 - 366
  • [48] A hybrid particle swarm optimization approach for the job-shop scheduling problem
    Wei-jun Xia
    Zhi-ming Wu
    The International Journal of Advanced Manufacturing Technology, 2006, 29 : 360 - 366
  • [49] Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach
    Choi, S. H.
    Wang, K.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 63 (02) : 362 - 373
  • [50] A SUBMODULAR OPTIMIZATION APPROACH TO BICRITERIA SCHEDULING PROBLEMS WITH CONTROLLABLE PROCESSING TIMES ON PARALLEL MACHINES
    Shioura, Akiyoshi
    Shakhlevich, Natalia V.
    Strusevich, Vitaly A.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (01) : 186 - 204