Integer Programming and Combinatorial Optimization

Volume 3064 of the series Lecture Notes in Computer Science pp 283-297

Single Machine Scheduling with Precedence Constraints

  • José R. CorreaAffiliated withOperations Research Center, Massachusetts Institute of Technology
  • , Andreas S. SchulzAffiliated withOperations Research Center, Massachusetts Institute of Technology

* Final gross prices may vary according to local VAT.

Get Access


We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. This problem has attracted much attention in the mathematical programming community since Sidney’s pioneering work in 1975. We look at the problem from a polyhedral perspective and uncover a relation between Sidney’s decomposition theorem and different linear programming relaxations. More specifically, we present a generalization of Sidney’s result, which particularly allows us to reason that virtually all known 2-approximation algorithms comply with his decomposition. Moreover, we establish a connection between the single-machine scheduling problem and the vertex cover problem. Indeed, in the special case of series-parallel precedence constraints, we prove that the sequencing problem can be seen as a special case of vertex cover. We also argue that this result is true for general precedence constraints if one can show that a certain integer program represents a valid formulation of the sequencing problem. Finally, we provide a characterization of the active inequalities of a linear programming relaxation in completion time variables.