Abstract
We consider nonpreemptive single-machine scheduling subject to precedence constraints. We define feasible schedules by the vector of the job completion times and study the structure of the convex hull of all feasible schedules, called the scheduling polyhedron P. We derive classes of valid inequalities for P, and necessary and sufficient conditions under which they are facet-inducing. Our main result is a complete description of the minimal linear system defining P when the precedence constraints are series-parallel. Moreover, this system consists of two classes of facet-inducing inequalities, associated with series and parallel compositions, respectively. If the precedence constraints are not series-parallel, we present another class of facet-inducing inequalities for P, associated with induced Z-subgraphs. We also show that the convex hull of all preemptive feasible schedules is identical to P if and only if the precedence constraints form an out-forest.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
