loading...
Heuristics Resolution of a Constrained Hybrid Flow Shop Problem
Cagliari, Sardinia, Italy June 26-June 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2006.8311th IEEE Symposium on Computers and ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
H. Hentous, M. Polytechnic School, Algeria
F. Benhammadi, M. Polytechnic School, Algeria
Flow shop problems have been extensively studied over the last decade, and numerous works have been published in this area. This paper deals with limited intermediate storage in hybrid flow shop organisation, considering unrelated volumes depending on jobs and including support constraints. For example, in many textile production systems, there are limited buffer storage between workshops and fixed numbers of conveyance supports. Such multistage production system uses iron beams (supports) on which yarn is rolled up. After partial processing on the system, the beams are emptied out and are recovered to be used again. The optimised criterion which is studied in this paper, is makespan (the biggest achievement date of jobs is minimised).
Index Terms:
Parallel machines, Flow shop, Hybrid shop, Limited buffers, Scheduling.
Citation:
H. Hentous, F. Benhammadi, "Heuristics Resolution of a Constrained Hybrid Flow Shop Problem," iscc, pp.532-535, 11th IEEE Symposium on Computers and Communications (ISCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.