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 条
  • [21] A multiproduct batch plant design model incorporating production planning and scheduling decisions under a multiperiod scenario
    Fumero, Yanina
    Susana Moreno, M.
    Corsano, Gabriela
    Montagna, Jorge M.
    23 EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, 2013, 32 : 505 - 510
  • [22] No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems
    Christoph J. Schuster
    Mathematical Methods of Operations Research, 2006, 63 : 473 - 491
  • [23] No-wait flowshop scheduling problem to minimize the number of tardy jobs
    Tariq A. Aldowaisan
    Ali Allahverdi
    The International Journal of Advanced Manufacturing Technology, 2012, 61 : 311 - 323
  • [24] Minimizing makespan for no-wait flowshop scheduling problems with setup times
    Ying, Kuo-Ching
    Lin, Shih-Wei
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 121 : 73 - 81
  • [25] No-wait flowshop scheduling problem to minimize the number of tardy jobs
    Aldowaisan, Tariq A.
    Allahverdi, Ali
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 61 (1-4) : 311 - 323
  • [26] A hybrid genetic algorithm for no-wait job shop scheduling problems
    Pan, Jason Chao-Hsien
    Huang, Han-Chiang
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (03) : 5800 - 5806
  • [27] No-wait job shop scheduling: tabu search and complexity of subproblems
    Schuster, Christoph J.
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2006, 63 (03) : 473 - 491
  • [28] An efficient method for no-wait flow shop scheduling to minimize makespan
    Li, Xiaoping
    Wang, Qian
    Wu, Cheng
    2006 10TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, PROCEEDINGS, VOLS 1 AND 2, 2006, : 1296 - 1301
  • [29] No-wait or no-idle permutation flowshop scheduling with dominating machines
    Wang J.-B.
    Xia Z.-Q.
    Journal of Applied Mathematics and Computing, 2005, 17 (1-2) : 419 - 432
  • [30] Minimizing makespan for solving the distributed no-wait flowshop scheduling problem
    Lin, Shih-Wei
    Ying, Kuo-Ching
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 202 - 209