Pages that link to "Item:Q3971735"

The following pages link to Single-Machine Scheduling Polyhedra with Precedence Constraints (Q3971735):

Displaying 37 items.

• Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
• Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms (Q434187) (← links)
• An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
• Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
• Parametric precedence relations in single machine scheduling (Q916560) (← links)
• Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
• Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
• On the convex hull of feasible solutions to certain combinatorial problems (Q1198616) (← links)
• Base polytopes of series-parallel posets: Linear description and optimization (Q1290639) (← links)
• Local search procedures for improving feasible solutions to the sequential ordering problem (Q1309885) (← links)
• Polynomial algorithms for single machine scheduling problems with financial constraints (Q1371954) (← links)
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
• Structure of a simple scheduling polyhedron (Q1803611) (← links)
• Review of properties of different precedence graphs for scheduling problems (Q1847252) (← links)
• How to make OR-results available: A proposal for project scheduling (Q1897419) (← links)
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
• Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times (Q2147050) (← links)
• Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
• Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
• The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
• Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686) (← links)
• Separable approximations and decomposition methods for the augmented Lagrangian (Q2943840) (← links)
• Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
• Single Machine Scheduling with Series-Parallel Precedence Constraints (Q3929382) (← links)
• A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
• (Q4494459) (← links)
• Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
• The affine hull of the schedule polytope for servicing identical requests by parallel devices (Q5100122) (← links)
• Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423) (← links)
• Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds (Q5101424) (← links)
• Single-Machine Scheduling with Precedence Constraints (Q5387960) (← links)
• Integer Programming and Combinatorial Optimization (Q5712461) (← links)
• The permutahedron of series-parallel posets (Q5906696) (← links)
• Facets of the generalized permutahedron of a poset (Q5961613) (← links)
• SPT optimality (mostly) via linear programming (Q6161291) (← links)
• Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests (Q6194920) (← links)