Skip to Main content Skip to Navigation
Reports

Two-Machine No-Wait Flowshop Scheduling Problem to Minimize Maximum Lateness with Separate Setup and Removal Times

Julien Fondrevelle 1 Ali Allahverdi Ammar Oulamara 1
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We address the two-machine no-wait flowshop scheduling problem to minimize maximum lateness where setup and removal times are treated as separate from processing time. We obtain optimal solutions for special cases. Moreover, we propose a branch-and-bound algorithm for the generic case. We conduct extensive experimentations to evaluate the performance of the proposed branch-and-bound algorithm. The computational analysis shows that the branch-and-bound algorithm is quite efficient, especially when the setup and removal times are not too large compared to the processing times. Moreover, in the absence of removal times, the dominance property proposed by Dileepan appears to perform very well.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00100231
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:15:56 AM
Last modification on : Tuesday, November 6, 2018 - 9:46:03 AM

Identifiers

  • HAL Id : inria-00100231, version 1

Collections

Citation

Julien Fondrevelle, Ali Allahverdi, Ammar Oulamara. Two-Machine No-Wait Flowshop Scheduling Problem to Minimize Maximum Lateness with Separate Setup and Removal Times. [Intern report] A04-R-406 || fondrevelle04c, 2004, 18 p. ⟨inria-00100231⟩

Share

Metrics

Record views

299