HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Permutation flowshops with exact time lags to minimize maximum lateness

Abstract : In this paper, we investigate the m-machine permutation flowshop scheduling problem where exact time lags are defined between consecutive operations of every job. The objective is to minimize the maximum lateness. We introduce different job types, depending on their time lags. 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. We perform a computational analysis to evaluate the efficiency of the proposed method.
Document type :
Complete list of metadata

Contributor : Julien Fondrevelle Connect in order to contact the contributor
Submitted on : Tuesday, August 9, 2005 - 4:32:57 PM
Last modification on : Friday, February 4, 2022 - 3:23:19 AM
Long-term archiving on: : Thursday, April 1, 2010 - 10:12:23 PM


  • HAL Id : inria-00000190, version 1



Julien Fondrevelle, Ali Allahverdi, Ammar Oulamara, Marie-Claude Portmann. Permutation flowshops with exact time lags to minimize maximum lateness. [Intern report] 2005, pp.18. ⟨inria-00000190⟩



Record views


Files downloads