Polytope scheduling with groups: unified models and optimal guarantees
From MaRDI portal
Cites work
- OPTVersusLOADin Dynamic Storage Allocation
- A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
- A comment on scheduling on uniform machines under chain-type precedence constraints
- A Level Algorithm for Preemptive Scheduling
- A Truthful Mechanism for Offline Ad Slot Scheduling
- Adaptive local ratio
- Approximating minimum sum coloring with bundles
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
- Approximation algorithms for shop scheduling problems with minsum objective
- Automata, Languages and Programming
- Bag-Of-Tasks Scheduling on Related Machines
- Bounds on Multiprocessing Timing Anomalies
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Competitive algorithms from competitive equilibria, non-clairvoyant scheduling under polyhedral constraints
- Convex quadratic and semidefinite programming relaxations in scheduling
- Corrigendum: ``Improved results for data migration and open shop scheduling
- Data migration to minimize the total completion time
- Eisenberg-Gale markets: algorithms and game-theoretic properties
- Improved Approximation Algorithms for Broadcast Scheduling
- Improved bounds for scheduling conflicting jobs with minsum criteria
- Integrality gap of time-indexed linear programming relaxation for coflow scheduling
- Lift-and-round to improve weighted completion time on unrelated machines
- Matroid coflow scheduling
- Minimum Color Sum of Bipartite Graphs
- Non-Clairvoyant Precedence Constrained Scheduling.
- Nonclairvoyant scheduling
- On scheduling coflows
- Online scheduling via gradient descent for weighted flow time minimization
- Optimal Long Code Test with One Free Bit
- Scheduling parallel machines for the customer order problem
- Scheduling Parallel Machines On-Line
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
- SelfishMigrate: a scalable algorithm for non-clairvoyantly scheduling heterogeneous processors
- Structure of a simple scheduling polyhedron
- Sum edge coloring of multigraphs via configuration LP
- The bargaining problem
- The Nash Social Welfare Function
- The power of preemption on unrelated machines and applications to scheduling orders
- The power of proportional fairness for non-clairvoyant scheduling under polyhedral constraints
- Time-efficient algorithms for Nash-bargaining-based matching market models
- Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
This page was built for publication: Polytope scheduling with groups: unified models and optimal guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349461)
