This paper tackles the two stages hybrid flow shop problem with dedicated machines. The problem consists in scheduling a set of jobs in a two stages workshop with respectively P and M dedicated machines. We present some theoretical properties and develop a number of lower bounds and a heuristic procedure. A mixed integer linear model is also tested.
Mots clés : Ordonnancement, Flow Shop, machines dédiées, heuristique