This thesis deals with scheduling problems in manufacturing cells. It aims at studying different classical models, analyzing links and differences between those models and the practical associated problems. The approach is to analyze the problems of our industrial partners, to study the complexity of the problems or the structure of their solution, and to propose exact or approached solution methods. The first axis of this thesis is the study of scheduling problems with in/out resource constraints. The problems considered are robotic flowshops and the new concept of operator non-availability. The second axis concerns scheduling problems with high multiplicity, where parts are aggregated into categories. Complete description of a schedule (i.e. the starting times of the operations) is then only pseudo-polynomial of the size of the input.
