MILP Modeling and Optimization of Energy- Efficient Distributed Flexible Job Shop Scheduling Problem

被引:51
作者
Meng, Leilei [1 ]
Ren, Yaping [2 ]
Zhang, Biao [1 ]
Li, Jun-Qing [1 ]
Sang, Hongyan [1 ]
Zhang, Chaoyong [3 ]
机构
[1] Liaocheng Univ, Sch Comp Sci, Liaocheng 252059, Shandong, Peoples R China
[2] Jinan Univ, Sch Intelligent Syst Sci & Engn, Zhuhai Campus, Zhuhai 519070, Peoples R China
[3] Huazhong Univ Sci & Technol, State Key Lab Digital Mfg Equipment & Technol, Wuhan 430074, Peoples R China
基金
中国国家自然科学基金;
关键词
Distributed flexible job shop scheduling problem; mixed integer linear programming; shuffled frog-leaping algorithm; variable neighborhood search; energy consumption; FROG-LEAPING ALGORITHM; HYBRID GENETIC ALGORITHM; FLOW-SHOP; HEURISTICS; SEARCH; SOLVE;
D O I
10.1109/ACCESS.2020.3032548
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the global warming problem and increasing energy cost, manufacturing firms are paying more and more attention to reducing energy consumption. This paper addresses the distributed flexible job shop scheduling problem (DFJSP) with minimizing energy consumption. To solve the problem, firstly, a novel mixed integer linear programming (MILP) model is developed to solve small-scaled problems to optimality. Due to the NP-hardness of DFJSP, we then propose an efficient hybrid shuffled frog-leaping algorithm (HSFLA) for solving DFJSP, particularly for large-sized problems. HSFLA combines the shuffled frog-leaping algorithm (SFLA) with powerful global search ability and variable neighborhood search (VNS) with good local search ability. Moreover, in HSFLA, the encoding method, the decoding method, the initialization method and the memetic evolution process are specifically designed. Finally, numerical experiments are conducted to evaluate the performance of the proposed MILP model and HFSLA.
引用
收藏
页码:191191 / 191203
页数:13
相关论文
共 45 条
[11]   Establishing prediction models for feeding power and material drilling power to support sustainable machining [J].
Jia, Shun ;
Yuan, Qinghe ;
Cai, Wei ;
Lv, Jingxiang ;
Hu, Luoke .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2019, 100 (9-12) :2243-2253
[12]   Energy modeling method of machine-operator system for sustainable machining [J].
Jia, Shun ;
Yuan, Qinghe ;
Cai, Wei ;
Li, Meiyan ;
Li, Zhaojun .
ENERGY CONVERSION AND MANAGEMENT, 2018, 172 :265-276
[13]   Therblig-embedded value stream mapping method for lean energy machining [J].
Jia, Shun ;
Yuan, Qinghe ;
Lv, Jingxiang ;
Liu, Ying ;
Ren, Dawei ;
Zhang, Zhongwei .
ENERGY, 2017, 138 :1081-1098
[14]   A modified genetic algorithm for distributed scheduling problems [J].
Jian, HZ ;
Nee, AYC ;
Fuh, JYH ;
Zhang, YF .
JOURNAL OF INTELLIGENT MANUFACTURING, 2003, 14 (3-4) :351-362
[15]   Solving energy-efficient distributed job shop scheduling via multi-objective evolutionary algorithm with decomposition [J].
Jiang, En-da ;
Wang, Ling ;
Peng, Zhi-ping .
SWARM AND EVOLUTIONARY COMPUTATION, 2020, 58
[16]   An efficient knowledge-based algorithm for the flexible job shop scheduling problem [J].
Karimi, Hamid ;
Rahmati, Seyed Habib A. ;
Zandieh, M. .
KNOWLEDGE-BASED SYSTEMS, 2012, 36 :236-244
[17]   An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem [J].
Kong Lu ;
Li Ting ;
Wang Keming ;
Zhu Hanbing ;
Makoto, Takano ;
Yu Bin .
ALGORITHMS, 2015, 8 (01) :19-31
[18]   A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption [J].
Lei, Deming ;
Zheng, Youlian ;
Guo, Xiuping .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (11) :3126-3140
[19]   A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents [J].
Lei, Deming ;
Guo, Xiuping .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (23) :9333-9339
[20]   An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system [J].
Li, Jun-qing ;
Bai, Shun-Chang ;
Duan, Pei-yong ;
Sang, Hong-yan ;
Han, Yu-yan ;
Zheng, Zhi-xin .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (22) :6922-6942