Two-Machine No-Wait Flowshop Scheduling Problem to Minimize Maximum Lateness with Separate Setup and Removal Times - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

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

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.
Not file

Dates and versions

inria-00100231 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100231 , version 1

Cite

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⟩
86 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More