Abstract.
The relation of time indexed formulations of nonpreemptive single machine scheduling problems to the node packing problem is established and then used to provide simple and intuitive alternate proofs of validity and maximality for previously known results on the facial structure of the scheduling problem. Previous work on the facial structure has focused on describing the convex hull of the set of feasible partial schedules, schedules in which not all jobs have to be started. The equivalence between the characteristic vectors of this set and those of the set of feasible node packings in a graph whose structure is determined by the parameters of the scheduling problem is established. The main contribution of this paper is to show that the facet inducing inequalities for the convex hull of the set of feasible partial schedules that have integral coefficients and right hand side 1 or 2 are the maximal clique inequalities and the maximally and sequentially lifted 5-hole inequalities of the convex hull of the set of feasible node packings in this graph respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: September 10, 2000 / Accepted: April 20, 2002 Published online: September 27, 2002
Key words. scheduling – node packing – polyhedral methods – facet defining graphs – lifted valid inequalities – facet inducing inequalities}
Rights and permissions
About this article
Cite this article
Waterer, H., Johnson , E., Nobili, P. et al. The relation of time indexed formulations of single machine scheduling problems to the node packing problem. Math. Program., Ser. A 93, 477–494 (2002). https://doi.org/10.1007/s10107-002-0335-9
Issue Date:
DOI: https://doi.org/10.1007/s10107-002-0335-9