Integration of planning, scheduling, and control of no-wait batch plant

被引:4
|
作者
Ji, Nan [1 ]
Gu, Xingsheng [1 ]
机构
[1] East China Univ Sci & Technol, Key Lab Smart Mfg Energy Chem Proc, Minist Educ, Meilong Rd 130, Shanghai 200237, Peoples R China
关键词
Process control; Scheduling; Production planning; Integration of planning; Scheduling and control; Batch plant; DYNAMIC OPTIMIZATION; FEASIBILITY ANALYSIS; TOTAL TARDINESS; DESIGN;
D O I
10.1016/j.compchemeng.2023.108467
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The batch process plays an important role in industrial production. Among them, production processes that have specific requirements for operational continuity in each processing stage should consider the no-wait constraint to meet the production reality. The batch process with a no-wait constraint is a typical NP-hard problem. In this work, we propose a framework for the integration of planning, scheduling, and control. We also propose a decomposition method with an improved genetic algorithm to solve the integration problem of scheduling and control for the no-wait batch process. The integrated formulation represents a typical mixed logic dynamic optimization (MLDO) problem, which involves logical disjunctions and operational dynamics. Then, we address the integrated problem as a grey-box optimization problem, using data-driven feasibility analysis and surrogate models to approximate the unknown black-box constraints. Finally, we test specific production instances to demonstrate the feasibility and superiority of the proposed integration model of the no-wait batch process and optimization algorithm.
引用
收藏
页数:19
相关论文
共 50 条
  • [31] A Harmony search algorithm for the no-wait flow shop optimization scheduling
    Gao Kaizhou
    Pan Quanke
    Zuo Fengchao
    Duan Junhua
    PROCEEDINGS OF THE 29TH CHINESE CONTROL CONFERENCE, 2010, : 1723 - 1726
  • [32] A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
    Dipak Laha
    Uday K. Chakraborty
    The International Journal of Advanced Manufacturing Technology, 2009, 41 : 97 - 109
  • [33] A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
    Laha, Dipak
    Chakraborty, Uday K.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41 (1-2) : 97 - 109
  • [34] An Ontological Approach to Integration of Planning and Scheduling Activities in Batch Process Industries
    Vegetti, Marcela
    Henning, Gabriela
    12TH INTERNATIONAL SYMPOSIUM ON PROCESS SYSTEMS ENGINEERING (PSE) AND 25TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING (ESCAPE), PT B, 2015, 37 : 995 - 1000
  • [35] A branch-and-cut approach for the distributed no-wait flowshop scheduling problem
    Avci, Mustafa
    Avci, Mualla Gonca
    Hamzadayi, Alper
    COMPUTERS & OPERATIONS RESEARCH, 2022, 148
  • [36] An Efficient Algorithm for Scheduling a Flexible Job Shop with Blocking and No-Wait Constraints
    Aschauer, A.
    Roetzer, F.
    Steinboeck, A.
    Kugi, A.
    IFAC PAPERSONLINE, 2017, 50 (01): : 12490 - 12495
  • [37] Approximability of two-machine no-wait flowshop scheduling with availability constraints
    Cheng, TCE
    Liu, ZH
    OPERATIONS RESEARCH LETTERS, 2003, 31 (04) : 319 - 322
  • [38] Control-aware batch process scheduling
    Santander, Omar
    Baldea, Michael
    COMPUTERS & CHEMICAL ENGINEERING, 2021, 152
  • [39] Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
    Wang, GQ
    Cheng, TCE
    INFORMATION PROCESSING LETTERS, 2001, 80 (06) : 305 - 309
  • [40] Scheduling multiple robots in a no-wait re-entrant robotic flowshop
    Che, Ada
    Chabrol, Michelle
    Gourgand, Michel
    Wang, Yuan
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 135 (01) : 199 - 208