Single-Machine Scheduling Polyhedra with Precedence Constraints
DOI10.1287/MOOR.16.1.1zbMATH Open0747.90051OpenAlexW2032912812MaRDI QIDQ3971735FDOQ3971735
Authors: Maurice Queyranne, Yaoguang Wang 
Publication date: 25 June 1992
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.16.1.1
Recommendations
single machineconvex hullsnon-preemptive schedulingprecedence constraintsfacet- inducing inequalities
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cited In (38)
- Separable approximations and decomposition methods for the augmented Lagrangian
- Mixed integer formulations using natural variables for single machine scheduling around a common due date
- Scheduling two chains of unit jobs on one machine: A polyhedral study
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- SPT optimality (mostly) via linear programming
- Integer Programming and Combinatorial Optimization
- Title not available (Why is that?)
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- Base polytopes of series-parallel posets: Linear description and optimization
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
- Single Machine Scheduling with Series-Parallel Precedence Constraints
- Polynomial algorithms for single machine scheduling problems with financial constraints
- Exact and Approximation Algorithms for the Expanding Search Problem
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
- Local search procedures for improving feasible solutions to the sequential ordering problem
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- On the convex hull of feasible solutions to certain combinatorial problems
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
- How to make OR-results available: A proposal for project scheduling
- The constrained minimum weighted sum of job completion times problem
- Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Single-Machine Scheduling with Precedence Constraints
- Preemptive scheduling and antichain polyhedra
- Multiprocessor scheduling under precedence constraints: polyhedral results
- Single machine precedence constrained scheduling is a Vertex cover problem
- The affine hull of the schedule polytope for servicing identical requests by parallel devices
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope
- Parametric precedence relations in single machine scheduling
- The permutahedron of series-parallel posets
- Facets of the generalized permutahedron of a poset
- Formulating a scheduling problem with almost identical jobs by using positional completion times
- Structure of a simple scheduling polyhedron
- Review of properties of different precedence graphs for scheduling problems
- A branch and bound algorithm for the minimum storage-time sequencing problem
This page was built for publication: Single-Machine Scheduling Polyhedra with Precedence Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971735)
