scientific article; zbMATH DE number 876684

Cited in

(20)

Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
Single machine scheduling problems with uncertain parameters and the OWA criterion
Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
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
scientific article; zbMATH DE number 4108474 (Why is no real title available?)
Two-agent scheduling in a flowshop
scientific article; zbMATH DE number 1946760 (Why is no real title available?)
A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
scientific article; zbMATH DE number 4189460 (Why is no real title available?)
Multiprocessor scheduling under precedence constraints: polyhedral results
Tree-width and the Sherali-Adams operator
The affine hull of the schedule polytope for servicing identical requests by parallel devices
Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
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

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)