A note on reverse scheduling with maximum lateness objective

Abstract

The inverse and reverse counterparts of the single-machine scheduling problem are studied in [2], in which the complexity classification is provided for various combinations of adjustable parameters (due dates and processing times) and for five different types of norm: , and . It appears that the -time algorithm for the reverse problem with adjustable due dates contains a flaw. In this note, we present the structural properties of the reverse model, establishing a link with the forward scheduling problem with due dates and deadlines. For the four norms , and , the complexity results are derived based on the properties of the corresponding forward problems, while the case of the norm is treated separately. As a by-product, we resolve an open question on the complexity of problem .