Weighted Tardiness Scheduling with Sequence-Dependent Setups: A Benchmark Problem for Soft Computing

In Applications of Soft Computing: Updating the State of the Art, volume 52 of Advances in Soft Computing, pages 189-198. Springer, .

[PDF] [BIB] [DOI]

Abstract

In this paper we present a set of benchmark instances and a benchmark instance generator for a single-machine scheduling problem known as the weighted tardiness scheduling problem with sequence-dependent setups. Furthermore, we argue that it is an ideal benchmark problem for soft computing in that it is computationally hard and does not lend itself well to exact solution procedures. Additionally, it has a number of important real world applications.