The following pages link to (Q4877166):
Displayed 14 items.
- Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
- Two-agent scheduling in a flowshop (Q322895) (← links)
- The linear extension polytope of a poset (Q510939) (← links)
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms (Q722523) (← links)
- Equivalence of permutation polytopes corresponding to strictly supermodular functions (Q947118) (← links)
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem (Q2253398) (← links)
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
- Tree-width and the Sherali-Adams operator (Q2386210) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- The affine hull of the schedule polytope for servicing identical requests by parallel devices (Q5100122) (← links)
- Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
- SPT optimality (mostly) via linear programming (Q6161291) (← links)