Single-Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times

The single-machine total weighted tardiness problem with sequence-dependent setup times is to find an optimal sequence of jobs to be processed on a single machine that minimizes the total weighted tardiness while considering setup times between jobs.  Here, "sequence-dependent" means that the setup time is determined by the last processed job and the job to be processed next.

[TA13] S. Tanaka and M. Araki. An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. Computers & Operations Research 40(1), pp. 344-352, 2013. DOI: 10.1016/j.cor.2012.07.004

• Benchmark set by Cicirello [C03]

  • [external link]

[C03] V.A. Cicirello. Weighted tardiness scheduling with sequence-dependent setups: A benchmark library. Technical Report. Intelligent Coordination and Logistics Laboratory, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA. (2003)