Exact methods for tardiness objectives in production scheduling

Tight deadlines, uncertain release dates and frequent disruptions impose major challenges for manufacturing. Therefore, we take a fresh look at the literature examining tardiness under unrelated machines, sequence-dependent setup times, precedence constraints, job-splitting and multiple resources. Our focus in on exact methods, including integrated methods combining Integer Programming and Constraint Programming. We also present a Bender's approach encompassing most of the above features, augmented with certain inequalities to represent additional problem features or to strengthen the relaxation. We offer computational evidence and discuss possible extensions. Copyright (C) 2022 The Authors.