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
Conference papers

Minimizing the weighted sum of machine completion times in flowshop with time lags

Julien Fondrevelle 1 Ammar Oulamara 1 Marie-Claude Portmann 1
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this article, we consider flowshop scheduling problems with time lag constraints to minimize the weighted sum of machine completion times as objective function. Although this criterion has been addressed in few papers, it may be extremely important in practical situations. We present several complexity results for two- and three-machine problems and propose a branch and bound method to solve the m-machine case.
Keywords : Flowshop weighted sum of machine completion times idle-time minimal and maximal time lags complexity branch and bound
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/inria-00000148
Contributor : Julien Fondrevelle Connect in order to contact the contributor
Submitted on : Wednesday, July 6, 2005 - 3:43:35 PM
Last modification on : Friday, February 4, 2022 - 3:23:39 AM

Identifiers

  • HAL Id : inria-00000148, version 1

Collections

INRIA | CNRS | LORIA | UNIV-LORRAINE | TDS-MACS | INRIA2

Citation

Julien Fondrevelle, Ammar Oulamara, Marie-Claude Portmann. Minimizing the weighted sum of machine completion times in flowshop with time lags. International Conference on Industrial Engineering and Systems Management - IESM'05, I4e2, May 2005, Marrakech/Maroc. ⟨inria-00000148⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

84

 

Contact                    Legal Notice                    Personal Data