scientific article; zbMATH DE number 876684
From MaRDI portal
Publication:4877166
zbMath0859.90088MaRDI QIDQ4877166
Publication date: 8 May 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Single machine scheduling problems with uncertain parameters and the OWA criterion ⋮ Two-agent scheduling in a flowshop ⋮ Tree-width and the Sherali-Adams operator ⋮ The affine hull of the schedule polytope for servicing identical requests by parallel devices ⋮ SPT optimality (mostly) via linear programming ⋮ Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality ⋮ Equivalence of permutation polytopes corresponding to strictly supermodular functions ⋮ The linear extension polytope of a poset ⋮ Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem ⋮ Multiprocessor scheduling under precedence constraints: polyhedral results ⋮ On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems ⋮ Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms ⋮ Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates ⋮ A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
