Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Production Economics Année : 2008

Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times

Résumé

In this article, we consider flowshop scheduling problems with minimal and maximal time lag constraints. Such constraints extend precedence constraints between operations in the jobs and may be used to model various industrial applications. The objective is to minimize a non-classical criterion based on the weighted sum of machine completion times. We show that it generalizes makespan and we derive several complexity results for two- and three-machine problems. An exact algorithm based on a branch-and-bound procedure is developed to solve the permutation flowshop problem with m machines.

Dates et versions

hal-00235174 , version 1 (04-02-2008)

Identifiants

Citer

Julien Fondrevelle, Ammar Oulamara, Marie-Claude Portmann. Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times. International Journal of Production Economics, 2008, 112 (1), pp.168-176. ⟨10.1016/j.ijpe.2006.08.018⟩. ⟨hal-00235174⟩
141 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More