Sorting common operations to minimize the number of tardy jobs

We study an operation scheduling problem where a finite set of jobs with due dates must be completed by one machine: each job is completed as soon as a specific subset of unit operations is done. Distinct jobs may share operations, and when an operation is done, it is done for all the jobs that share it. The goal is to schedule operations so that the weighted number of tardy jobs is minimized. We reformulate the problem as maximum stable set problem on a special graph and study its structure. Valid inequalities and optimality cuts are derived, separated, and tested in a computational experience that identifies some features of hard instances and the potential contribution of the addition, at root, of various cut classes. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 644, 306-320 2014