Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00000190
Contributor : Julien Fondrevelle <>
Submitted on : Tuesday, August 9, 2005 - 4:32:57 PM
Last modification on : Tuesday, November 6, 2018 - 9:46:04 AM
Long-term archiving on: : Thursday, April 1, 2010 - 10:12:23 PM

Identifiers

  • HAL Id : inria-00000190, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

167

Files downloads

123