, Volume 58, Issue 1-3, pp 263-285

Structure of a simple scheduling polyhedron

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In a one-machine nonpreemptive scheduling problem, the feasible schedules may be defined by the vector of the corresponding job completion times. For given positive processing times, the associated simple scheduling polyhedronP is the convex hull of these feasible completion time vectors. The main result of this paper is a complete description of the minimal linear system definingP. We also give a complete, combinatorial description of the face lattice ofP, and a simple, O(n logn) separation algorithm. This algorithm has potential usefulness in cutting plane type algorithms for more difficult scheduling problems.