scientific article; zbMATH DE number 876684
From MaRDI portal
Publication:4877166
zbMATH Open0859.90088MaRDI QIDQ4877166FDOQ4877166
Publication date: 8 May 1996
Title of this publication is not available (Why is that?)
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cited In (20)
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- SPT optimality (mostly) via linear programming
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
- On the extension complexity of scheduling polytopes
- Title not available (Why is that?)
- Two-agent scheduling in a flowshop
- Title not available (Why is that?)
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- Title not available (Why is that?)
- Multiprocessor scheduling under precedence constraints: polyhedral results
- The affine hull of the schedule polytope for servicing identical requests by parallel devices
- Tree-width and the Sherali-Adams operator
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality
- The linear extension polytope of a poset
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- On some geometric methods in scheduling theory: A survey
- Equivalence of permutation polytopes corresponding to strictly supermodular functions
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4877166)
