Solving a generalized model for CON due date assignment and sequencing

This paper considers a generalized model for assigning a constant flow allowance (CON) due date to a set of jobs and sequencing them on a single machine. The sequencing aspect of the model has so far received little attention in the literature, although it is well recognized that this aspect is quite challenging. Here the authors cast the problem as a 0-1 quadratic program and solve it as such. In particular, they provide an extremely effective heuristic, which is really a greedy randomized adaptive search procedure, for solving the quadratic program, and report the results of a computational study to verify its effectiveness.