Weighted Tardiness Scheduling with Sequence-Dependent Setups : A Benchmark Library

Abstract

This report details a set of benchmark problem instances that we have generated for the weighted tardiness scheduling with sequence-dependent setups problem. The version of the problem without setup times is NP-Hard. The problem is further complicated by the sequence-dependent nature of the setups. Given that the weighted tardiness objective and the… (More)

Topics

  • Presentations referencing similar topics