Modeling of energy-saving blocking hybrid flow shop scheduling problem

被引：0
|
作者：
Meng L. [1 ,2 ]
Zhang C. [2 ]
Zhang B. [1 ]
Li J. [1 ]
机构：
[1] School of Computer Science, Liaocheng University, Liaocheng
[2] State Key Lab of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan
来源：
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) | 2021年 / 49卷 / 07期
关键词：
Blocking; Energy consumption; Hybrid flow shop scheduling; Mixed integer linear programming; Setup time;
D O I：
10.13245/j.hust.210722
中图分类号：
学科分类号：
摘要：
Aiming at the blocking hybrid flow shop scheduling problem (HFSP-B) with the objective of energy consumption, a mixed integer linear programming (MILP) model considering setup times and without considering setup times was proposed. To reduce the idle energy consumption of the machine tool, turning off/restartingenergy-saving strategy was considered in the MILP model. For the MILP model, it was introduced from objective function, the linearization processes of objective function, decision variables and constraint equations. Finally, the effectiveness of MILP model was evaluated by solving real instances. By analyzing the optimal solutions obtained by the MILP model, the influence law of blocking factor on energy consumption objective was mined, which could help to design approximate method based on meta-heuristic algorithm in future research. © 2021 Editorial Board of Journal of Huazhong University of Science and Technology. All right reserved.
引用
收藏
页码：127 / 132
页数：5
相关论文
共 15 条
  • [1] 37, 5, pp. 86-89
  • [2] LI J, PAN Q., Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm, Information Sciences, 316, pp. 487-502, (2015)
  • [3] 4
  • [4] WANG X, TANG L., A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers, Computers & Operations Research, 36, 3, pp. 907-918, (2009)
  • [5] 3
  • [6] 40, 5, pp. 856-859
  • [7] WARDONO B, FATHI Y., A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities, European Journal of Operational Research, 155, 2, pp. 380-401, (2004)
  • [8] TAVAKKOLI-MOGHADDAM R, SAFAEI N, SASSANI F., A memetic algorithm for the flexible flow line scheduling problem with processor blocking, Computers & Operations Research, 36, 2, pp. 402-414, (2009)
  • [9] HAKIMZADEH ABYANEH S, ZANDIEH M., Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers, The International Journal of Advanced Manufacturing Technology, 58, 1, pp. 309-325, (2012)
  • [10] YAURIMA V, BURTSEVA L, TCHERNYKH A., Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers, Computers & Industrial Engineering, 56, 4, pp. 1452-1463, (2009)
12