Permutation flowshops with exact time lags to minimize maximum lateness

Julien Fondrevelle (1) , Ammar Oulamara (2, 3) , M C Portmann (3) , Ali Allahverdi (4)

1 LIESP - Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production
2 ORCHIDS - Operations research for Complex HybrId Decision Sytems
3 INPL - Institut National Polytechnique de Lorraine
4 Dept of Indl and Mgmt Systems Engineering

In this paper, we investigate the m-machine permutation flowshop scheduling problem where exact time lags are defined between consecutive operations of every job. This generic model can be used for the study and analysis of various real situations, which may arise, for instance, in food-producing, pharmaceutical or steel industries. The objective is to minimize the maximum lateness. We study polynomial special cases and provide a dominance relation. We derive lower and upper bounds that are integrated in a branch-and-bound procedure to solve the problem. Three branching schemes are proposed and compared. We perform a computational analysis to evaluate the efficiency of the developed method.

Mots clés: Physical Sciences; Physical Sciences

Domaines: Recherche opérationnelle [math.OC]

Julien Fondrevelle, Ammar Oulamara, M C Portmann, Ali Allahverdi. Permutation flowshops with exact time lags to minimize maximum lateness. International Journal of Production Research, 2009, 47 (23), pp.6759-6775. ⟨10.1080/00207540802320164⟩. ⟨hal-00525859⟩