Les problèmes d'ordonnancement de type flow-shop hybride :état de l'art

Author: Vignier A.   Billaut J.-C.   Proust C.  

Publisher: Edp Sciences

E-ISSN: 1290-3868|33|2|117-183

ISSN: 0399-0559

Source: RAIRO - Operations Research, Vol.33, Iss.2, 2010-03, pp. : 117-183

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

A special class of scheduling problems is studied in this paper, named Hybrid Flowshop, n jobs have to be performedin a shop and each of them has the same routing (so this is a flowshop). A job consists in k different operations. A set of machines are able to perform each operation and thisset is called a stage. So when a job consists in two operations,there are two stages in the shop. After introducing the scheduling generalities, we define our preocupations and we propose a notationin order to identify precisely and rapidly a problem. Then a state of the art is proposed and presented in two parts. The first one is dedicated to the 2-stage hybrid flowshops and the second to thegeneral case of the k-stage. Then a summary puts to the fore that many problems remain unsolved.