Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness

被引:88
作者
Botta-Genoulaz, V [1 ]
机构
[1] Inst Natl Sci Appl, PRISMa, F-69621 Villeurbanne, France
关键词
hybrid flow shop; scheduling; heuristics; precedence constraints; time lags;
D O I
10.1016/S0925-5273(99)00048-1
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We study the scheduling of N jobs in a V-stage hybrid flow shop with identical parallel machines, when jobs are subject to precedence constraints, several time lags, and due-dates. Precedence constraints concern jobs; they enable the modeling of several uses of the same sequence of machines or different processing units in a flow shop organization. Time lags can be either machine setup time, machine removal time or transportation time. Six new heuristics are presented to solve this problem minimizing maximum lateness. Numerous experiments have been done to assess the performance and robustness of these algorithms. Computational results illustrate the solution quality. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:101 / 111
页数:11
相关论文
共 17 条
[1]  
ARTIBA A, 1997, P INT C OP QUANT MAN, P467
[2]  
BOTTA V, 1997, P IEEE INT S ASS TAS, P194
[3]  
BOTTA V, 1996, P WORKSH PROD PLANN, P16
[4]  
CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630
[5]   EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS [J].
DANNENBRING, DG .
MANAGEMENT SCIENCE, 1977, 23 (11) :1174-1182
[6]  
French S., 1982, Sequencing and Scheduling
[7]  
GUINET A, 1995, P INT IND ENG C MONT, V3, P2019
[8]  
GUINET A, 1996, P WORKSH PROD PLANN, P299
[9]   Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time [J].
Guinet, AGP ;
Solomon, MM .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (06) :1643-1654
[10]   SCHEDULING A 2-STAGE HYBRID FLOWSHOP WITH SEPARABLE SETUP AND REMOVAL TIMES [J].
GUPTA, JND ;
TUNC, EA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 77 (03) :415-428