Relaxations for the polyhedron of optimal schedules for the problem of interrupt-oriented service of jobs with a single machine

We consider the problem of minimizing the total service time of different jobs from one device preemption. We construct two classes of hyperplanes containing polyhedron of optimal schedules for this problem and describe computer experiments. Ill. 4, tab. 1, bibliogr. 6.