Scheduling of industrial distribution manifolds with pre-conditions

被引:2
作者
Amaro, ACS
Barbosa-Póvoa, APFD
机构
[1] Univ Tecn Lisboa, Unidade Econ & Gestao Ind, Inst Super Tecn, P-1096 Lisbon, Portugal
[2] ISCAC Quinta Agricola, Inst Super Contabilidade & Adm, P-3040 Bencanta Coimbra, Portugal
关键词
modelling; scheduling; integer programming; optimisation; distribution manifolds;
D O I
10.1016/S0377-2217(99)00147-2
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The scheduling of two types of manifolds typically found in multipurpose plants is considered. These are, respectively, single and double seat valve manifolds. Although they perform the same general function they are characterised by different operational and structural characteristics. Within the general scheduling problem important aspects such as operational pre-conditions and constraints are considered (e.g. product sequencing and cleaning requirements). These must be guaranteed during operation in order to avoid compromising final product quality, safety and feasibility of operation. The flowpath formulation proposed by Barbosa-Povoa and Macchietto [4] for the scheduling of distribution manifolds is extended so as to account for operational conditions, modelled through the equipment State Task Network (eSTN) representation [3] and to allow for simultaneous operation of compatible flowpaths with different transfer times. Operating objectives such as due dates, maximal production and production profit are considered. A Mixed Integer Linear Programming (MILP) formulation is developed and solved using a Branch and Bound (B&B) standard procedure. Binary variables are used to represent the operational choices that have to be made. An example illustrating the flexibility and applicability of the new formulation to the scheduling of distribution manifolds dealing with operating constraints is presented. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:461 / 478
页数:18
相关论文
共 12 条
[1]  
AMARO ACS, 1996, THESIS TU LISBON LIS
[2]  
BALL A, 1990, PROCESS ENG FOOD IND, V2, P118
[3]  
BARBOSAPOVOA APF, 1994, IFORS 94
[4]  
BARBOSAPOVOA APF, 1994, THESIS U LONDON LOND
[5]  
GOLDMAN RP, 1997, IEEE, V1, P49
[6]   A GENERAL ALGORITHM FOR SHORT-TERM SCHEDULING OF BATCH-OPERATIONS .1. MILP FORMULATION [J].
KONDILI, E ;
PANTELIDES, CC ;
SARGENT, RWH .
COMPUTERS & CHEMICAL ENGINEERING, 1993, 17 (02) :211-227
[7]  
MACCHIETTO S, 1992, WORKSH INTERACTIONS
[8]  
Pinedo M., 1995, Scheduling: Theory, Algorithms, and Systems, V2nd
[9]  
REKLAITIS G, 1992, P NATO ADV STUD I BA
[10]  
RIPPIN D, 1993, COMPUT CHEM ENG, V17, pS211