scientific article; zbMATH DE number 7561638
From MaRDI portal
Publication:5092350
DOI10.4230/LIPIcs.ICALP.2019.145MaRDI QIDQ5092350
Sungjin Im, Manish Purohit, Benjamin Moseley, Kirk R. Pruhs
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Minimizing the sum of weighted completion times in a concurrent open shop
- Scheduling orders for multiple product types to minimize total weighted completion time
- Testing membership in matroid polyhedra
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Preemptive and non-preemptive generalized min sum set cover
- On scheduling coflows (extended abstract)
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
- Scheduling Unrelated Machines by Randomized Rounding
- A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
- Order Scheduling Models: Hardness and Algorithms
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- Select and permute: an improved online framework for scheduling to minimize weighted completion time
This page was built for publication:
