Skip to Main content Skip to Navigation
Conference papers

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

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.
Document type :
Conference papers
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02497493
Contributor : Daniel Gavrysiak <>
Submitted on : Tuesday, March 3, 2020 - 4:45:09 PM
Last modification on : Wednesday, March 4, 2020 - 1:34:26 AM

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

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⟩

Share

Metrics

Record views

36