SCI和EI收录∣中国化工学会会刊

›› 2017, Vol. 25 ›› Issue (8): 1022-1036.DOI: 10.1016/j.cjche.2017.03.014

• Article • 上一篇    下一篇

Rule-based scheduling of multi-stage multi-product batch plants with parallel units

Bin Shi, Xinrui Qian, Shanshan Sun, Liexiang Yan   

  1. Department of Chemical Engineering, Wuhan University of Technology, Wuhan 430070, China
  • 收稿日期:2016-09-28 修回日期:2016-12-25 出版日期:2017-08-28 发布日期:2017-09-11
  • 通讯作者: Bin Shi
  • 基金资助:
    Supported by the National Natural Science Foundation of China (21376185)

Rule-based scheduling of multi-stage multi-product batch plants with parallel units

Bin Shi, Xinrui Qian, Shanshan Sun, Liexiang Yan   

  1. Department of Chemical Engineering, Wuhan University of Technology, Wuhan 430070, China
  • Received:2016-09-28 Revised:2016-12-25 Online:2017-08-28 Published:2017-09-11
  • Supported by:
    Supported by the National Natural Science Foundation of China (21376185)

摘要: A novel rule-based model for multi-stage multi-product scheduling problem (MMSP) in batch plants with parallel units is proposed. The scheduling problem is decomposed into two sub-problems of order assignment and order sequencing. Firstly, hierarchical scheduling strategy is presented for solving the former sub-problem, where the multi-stage multi-product batch process is divided into multiple sequentially connected single process stages, and then the production of orders are arranged in each single stage by using forward order assignment strategy and backward order assignment strategy respectively according to the feature of scheduling objective. Line-up competition algorithm (LCA) is presented to find out optimal order sequence and order assignment rule, which can minimize total flow time or maximize total weighted process time. Computational results show that the proposed approach can obtain better solutions than those of the literature for all scheduling problems with more than 10 orders. Moreover, with the problem size increasing, the solutions obtained by the proposed approach are improved remarkably. The proposed approach has the potential to solve large size MMSP.

关键词: Line-up competition algorithm, Order assignment rule, Multi-stage multi-product, Parallel unit, Scheduling optimization

Abstract: A novel rule-based model for multi-stage multi-product scheduling problem (MMSP) in batch plants with parallel units is proposed. The scheduling problem is decomposed into two sub-problems of order assignment and order sequencing. Firstly, hierarchical scheduling strategy is presented for solving the former sub-problem, where the multi-stage multi-product batch process is divided into multiple sequentially connected single process stages, and then the production of orders are arranged in each single stage by using forward order assignment strategy and backward order assignment strategy respectively according to the feature of scheduling objective. Line-up competition algorithm (LCA) is presented to find out optimal order sequence and order assignment rule, which can minimize total flow time or maximize total weighted process time. Computational results show that the proposed approach can obtain better solutions than those of the literature for all scheduling problems with more than 10 orders. Moreover, with the problem size increasing, the solutions obtained by the proposed approach are improved remarkably. The proposed approach has the potential to solve large size MMSP.

Key words: Line-up competition algorithm, Order assignment rule, Multi-stage multi-product, Parallel unit, Scheduling optimization