The design and scheduling of chemical batch processes: Computational complexity studies

作     者：de Miranda, Joao Luis 

作者机构：Inst Politecn Portalegre P-7300110 Portalegre Portugal Univ Lisbon Inst Super Tecn CERENA Ctr Recursos Nat & Ambiente Ave Rovisco Pais P-1049001 Lisbon Portugal 

出 版 物：《COMPUTERS & CHEMICAL ENGINEERING》 (计算机与化工)

年 卷 期：2019年第121卷

页      面：367-374页

核心收录：

学科分类：0817[工学-化学工程与技术] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Centro de Recursos Naturais e Ambiente at Instituto Superior Tecnico (CERENA/IST) within FCT-Fundacao para a Ciencia e a Tecnologia [UID/ECI/04028/2013] 

主　　题：Computational complexity Design and scheduling Batch processes Algorithms Pharmaceutical supply chains Medicines shortages 

摘      要：The pharmaceutical industry is quite restrictive concerning quality and safety, the manufacturing disruptions often lead to drug shortages in despite of the high costs involved. Due to the minimization of equipment costs, the design and scheduling of chemical batch processes (DSCBP) is a well-known problem, and various sub-problems are selected from the literature because they were successively enlarging the design and schedule policies: single machine or multiple machines (S or M) in each stage;and single product campaigns or multiple products campaigns (S PC or M PC). In this paper, four problems are studied (by combinatorics: SS, MS, SM, and MM) and it is shown that they are all NP-hard in strong sense through polynomial reduction. This study can support innovative algorithms and methodologies for solving DSCBP problems, in a way to improve equipments sizing and configurations design, and thereby contributing to curb disruptions within pharmaceutical supply chains (PharmSC). (C) 2018 Elsevier Ltd. All rights reserved.