The following pages link to (Q3579372):
Displaying 19 items.
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs'' (Q987836) (← links)
- A note on graph balancing problems with restrictions (Q990093) (← links)
- A 3/2-approximation algorithm for the graph balancing problem with two weights (Q1736801) (← links)
- Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
- Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
- Parallel machine scheduling with nested job assignment restrictions (Q2270323) (← links)
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- Structured Instances of Restricted Assignment with Two Processing Times (Q2971651) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- (Q5075832) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Lazy Local Search Meets Machine Scheduling (Q5237306) (← links)
- Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← links)
