Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
We deal here with a scheduling problem () which is an extension of both the well-known and the . We first propose a reformulation of : according to it, solving means finding a vertex of the of an . Next, we state several theoretical results related to this reformulation process and to structural properties of this specific (connectivity, ...). We end by focusing on the preemptive case of and by identifying specific instances of which are such that any vertex of the related may be projected...