Pages that link to "Item:Q3705207"

The following pages link to On the facial structure of scheduling polyhedra (Q3705207):

Displaying 37 items.

• New directions in scheduling theory (Q786649) (← links)
• Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
• Formulating the single machine sequencing problem with release dates as a mixed integer program (Q909575) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• Stability of an optimal schedule (Q1183618) (← links)
• On the convex hull of feasible solutions to certain combinatorial problems (Q1198616) (← links)
• Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• The relation of time indexed formulations of single machine scheduling problems to the node packing problem (Q1396279) (← links)
• The flow shop scheduling polyhedron with setup times (Q1417853) (← links)
• Models for representing piecewise linear cost functions (Q1433660) (← links)
• Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
• A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← 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)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• Sequential convexification in reverse convex and disjunctive programming (Q1825137) (← links)
• How to make OR-results available: A proposal for project scheduling (Q1897419) (← links)
• A family of inequalities valid for the robust single machine scheduling polyhedron (Q2270446) (← links)
• The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
• The project scheduling polyhedron: Dimension, facets and lifting theorems (Q2367366) (← links)
• On the extension complexity of scheduling polytopes (Q2661503) (← links)
• Decomposition Algorithm for the Single Machine Scheduling Polytope (Q3195338) (← links)
• A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
• A new approach to computing optimal schedules for the job-shop scheduling problem (Q4645937) (← links)
• The path set polytope of an acyclic, directed graph with an application to machine sequencing (Q4733692) (← links)
• The affine hull of the schedule polytope for servicing identical requests by parallel devices (Q5100122) (← links)
• Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds (Q5101424) (← links)
• General variable neighborhood search for the parallel machine scheduling problem with two common servers (Q6063516) (← 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)
• Self-adaptive general variable neighborhood search algorithm for parallel machine scheduling with unrelated servers (Q6551084) (← links)
• Improving branch and bound for jobshop scheduling with constraint propagation (Q6567676) (← links)
• Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations (Q6568449) (← links)
• Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time (Q6577341) (← links)
• Minimization of maximum lateness on parallel machines with a single server and job release dates (Q6614640) (← links)