Pages that link to "Item:Q5392904"
From MaRDI portal
The following pages link to An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables (Q5392904):
Displaying 30 items.
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- Speed-robust scheduling. Sand, bricks, and rocks (Q2061889) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q2085740) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path (Q2331579) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- A unified framework for designing EPTAS for load balancing on parallel machines (Q2415372) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- Speed-robust scheduling: sand, bricks, and rocks (Q2689830) (← links)
- An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints (Q2958349) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Closing the Gap for Makespan Scheduling via Sparsification Techniques (Q3387928) (← links)
- The Support of Integer Optimal Solutions (Q4577743) (← links)
- On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
- Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846) (← links)
- New Algorithmic Results for Bin Packing and Scheduling (Q5283351) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- Online load balancing on uniform machines with limited migration (Q6106523) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q6108926) (← links)
- EPTAS for parallel identical machine scheduling with time restrictions (Q6123390) (← links)
- The prize-collecting single machine scheduling with bounds and penalties (Q6621854) (← links)
