Scheduling-Polyhedron with a Time-Horizon

In a single machine scheduling problem where the machine can handle only one job at a time and is non preemptive, we look at schedules on a finite horizon [0, T]. These schedules are defined by a vector containing the completion times of each job. For positive processing times, a polyhedron P can be constituted that completely describes the convex hull of these feasible schedules. In this thesis we find this P and prove that it is the convex hull of all feasible schedules on the horizon [0, T]