DocumentCode :
2380852
Title :
Sequencing flow shops with arbitrary intermediate storage
Author :
Benlogab, A. ; Descotes-Genon, B.
Author_Institution :
Lab. d´´Autom. de Grenoble, CNRS, St. Martin d´´Heres, France
fYear :
1994
fDate :
16-18 Aug 1994
Firstpage :
196
Lastpage :
200
Abstract :
This paper deals with the deterministic flow shop problem and its connection with limited buffer storage. The system behaviour analysis in both transient and steady state enables one to estimate the mean gaps between ending and starting times of consecutive operations with respect to the same machine. In the proposed method, two-upper and lower bounds are gradually determined in order to carry out a near optimal jobs sequencing, minimizing the latest completion time criterion. Several tests made with uniformly distributed random data prove the efficiency of this method
Keywords :
operations research; optimisation; production control; stock control; arbitrary intermediate storage; buffer storage; completion time; deterministic flow shop; flow shops sequencing; heuristic; lower bounds; mean gap estimation; steady state; system behaviour analysis; transient state; upper bounds; Buffer storage; Costs; Insurance; Job shop scheduling; Manufacturing industries; Operations research; Production facilities; Production systems; Testing; Transient analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control, 1994., Proceedings of the 1994 IEEE International Symposium on
Conference_Location :
Columbus, OH
ISSN :
2158-9860
Print_ISBN :
0-7803-1990-7
Type :
conf
DOI :
10.1109/ISIC.1994.367818
Filename :
367818
Link To Document :
بازگشت