Abstract
The paper deals with a set of identical requirements processing schedules for parallel machines. The precedence constraints are set, interrupts are prohibited, time is discrete. This set of schedules is the set of feasible solutions to a number of optimization problems which are determined by various objective functions. The paper proposes the set of all schedules as a family of subsets of a finite set and defines the schedule polytope as the convex hull of incidence vectors. The report deals with the affine hull and polyhedral relaxation of the scheduling polytope. Polyhedral relaxation includes nonnegativity constraints, constraints as to the number of machines, and precedence constraints. Using the bH-basis technique, the work shows that constraints for nonnegativity generate facets of the scheduling polytope. Necessary conditions for facet constraints to the number of machines and precedence constraints are found.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have