Three stage no-idle flow-shops

被引：43

作者：

Saadani, NE

Guinet, A

Moalla, M

机构：

[1] Fac Sci Tunis, Lab LIP2, Dept Informat, Tunis 1060, Tunisia

[2] INSA, Lab PRISMa, Dep GPR, F-69621 Villeurbanne, France

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2003年 / 44卷 / 03期

关键词：

scheduling; permutation flow-shop; no-idle machines; Johnson's rule;

D O I：

10.1016/S0360-8352(02)00217-6

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The three stage no-idle flow-shop configuration, where machines work continuously without idle intervals, is an interesting manufacturing environment in many industries. Few researches have investigated this type of systems. The idle characteristic is a very strong constraint and it affects seriously the value of makespan (C max) criterion. We treat here the scheduling problem of three stage permutation flow-shop configuration with no-idle machines in order to minimise the makespan F3/no-idle/C max. An easily implementing heuristic is proposed to solve this problem with O(n log n) complexity. It finds optimal solutions for several cases. A computational study shows the result quality. (C) 2002 Elsevier Science Ltd. All rights reserved.

引用

页码：425 / 434

页数：10

共 12 条

[1] FLOWSHOP NO-IDLE OR NO-WAIT SCHEDULING TO MINIMIZE THE SUM OF COMPLETION TIMES [J].