Modelling multi-stage manufacturing systems for efficient scheduling

被引:2
作者
Charalambous, C
Tahmassebi, T
Hindi, K
机构
[1] Brunel Univ, Dept Mfg & Engn Syst, Uxbridge UB8 3PH, Middx, England
[2] Unilever Res, Port Sunlight Lab, Bebington Wirral L63 3JW, Merseyside, England
关键词
manufacturing systems; scheduling; modelling; heuristics; simulated annealing;
D O I
10.1016/S0377-2217(99)00236-2
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
A novel approach to modelling complex, multi-stage manufacturing systems is presented. This approach is both generally applicable and powerful. The purpose of the model is to underpin the development of short-term schedules for the large Variety of manufacturing systems present in the process industry. Such systems comprise stages that consist of parallel units and are dedicated to specific tasks such as producing, packing or intermediate storage. A two-level model is developed. At the first level, a generic model enables the formal definition of different systems. The second level deals with the system operations, providing a heuristic algorithm for the scheduling of individual processes. Based on the model, a solution representation is developed by dividing demand into sublets and treating each sublet sequence as a system schedule. Metaheuristic search is employed for the identification of efficient sequences. The results of a case study on a real-life industrial plant are presented. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:329 / 338
页数:10
相关论文
共 10 条
[1]   ANALYSIS OF CLASSES OF HEURISTICS FOR SCHEDULING A 2-STAGE FLOW-SHOP WITH PARALLEL MACHINES AT ONE-STAGE [J].
CHEN, B .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1995, 46 (02) :234-244
[2]   JOB SCHEDULING IN PETROCHEMICAL PRODUCTION - 2-STAGE PROCESSING WITH FINITE INTERMEDIATE STORAGE [J].
DEAL, DE ;
YANG, T ;
HALLQUIST, S .
COMPUTERS & CHEMICAL ENGINEERING, 1994, 18 (04) :333-344
[3]   General approach and tool for the scheduling of complex production systems [J].
Graells, M ;
Canton, J ;
Peschaud, B ;
Puigjaner, L .
COMPUTERS & CHEMICAL ENGINEERING, 1998, 22 :S395-S402
[4]   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
[5]   The flow shop with parallel machines: A tabu search approach [J].
Nowicki, E ;
Smutnicki, C .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) :226-253
[6]  
PINTO J, 1994, COMPUT CHEM ENG, V19, P797
[7]   MINLP MODEL FOR CYCLIC MULTIPRODUCT SCHEDULING ON CONTINUOUS PARALLEL LINES [J].
SAHINIDIS, NV ;
GROSSMANN, IE .
COMPUTERS & CHEMICAL ENGINEERING, 1991, 15 (02) :85-103
[8]  
SHAUKAT AB, 1991, EUR J OPER RES, V51, P88
[9]   Improving the efficiency of discrete time scheduling formulation [J].
Yee, KL ;
Shah, N .
COMPUTERS & CHEMICAL ENGINEERING, 1998, 22 :S403-S410
[10]  
ZENTNER MG, 1992, P NATO ASI BATCH PRO