An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

  • Authors:

  • Shunji Tanaka;Mituhiko Araki

  • Affiliations:

  • Department of Electrical Engineering, Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, Kyoto City, Kyoto 615-8510, Japan;Matsue College of Technology, 14-4 Nishiikuma-Cho, Matsue City, Shimane 690-8518, Japan

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2013

Quantified Score

Hi-index 0.01

Visualization

Abstract

This study proposes an exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. The algorithm is an extension of the authors' previous algorithm for the single-machine scheduling problem without setup times, which is based on the SSDP (Successive Sublimation Dynamic Programming) method. In the first stage of the algorithm, the conjugate subgradient algorithm or the column generation algorithm is applied to a Lagrangian relaxation of the original problem to adjust multipliers. Then, in the second stage, constraints are successively added to the relaxation until the gap between lower and upper bounds becomes zero. The relaxation is solved by dynamic programming and unnecessary dynamic programming states are eliminated to suppress the increase of computation time and memory space. In this study a branching scheme is integrated into the algorithm to manage to solve hard instances. The proposed algorithm is applied to benchmark instances in the literature and almost all of them are optimally solved.