Minimizing total tardiness on a single machine with sequence-dependent setup times - Archive ouverte HAL Access content directly
Conference Papers Year :

Minimizing total tardiness on a single machine with sequence-dependent setup times

(1) , (1) , (1)
1

Abstract

In this paper, we study the single machine scheduling problem with setup times for minimizing total tardiness. Such a problem is NP-hard and presents many difficulties to be solved. To reduce these difficulties, we propose a branch and bound algorithm. Our method is based on a new lower bound and is compared with Ragatz lower bound. New dominance rule and original exploration strategy are also proposed. Preliminary numerical simulations are encouraging and promising.
Not file

Dates and versions

hal-02497493 , version 1 (03-03-2020)

Identifiers

Cite

Ahmed Souissi, Imed Kacem, Chengbin Chu. Minimizing total tardiness on a single machine with sequence-dependent setup times. 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), Oct 2004, The Hague, Netherlands. pp.1481-1485, ⟨10.1109/ICSMC.2004.1399840⟩. ⟨hal-02497493⟩

Collections

CNRS UTT LOSI
17 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More