Pages that link to "Item:Q2819574"
From MaRDI portal
The following pages link to Improved approximation schemes for scheduling unrelated parallel machines (Q2819574):
Displaying 41 items.
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines (Q1061599) (← links)
- Approximation schemes for scheduling on parallel machines (Q1268852) (← links)
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
- Improved bounds on relaxations of a parallel machine scheduling problem (Q1383802) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- An almost ideal coordination mechanism for unrelated machine scheduling (Q1733383) (← links)
- Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
- 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines (Q1799571) (← links)
- Approximation schemes for scheduling on uniformly related and identical parallel machines (Q1879359) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- Real-time scheduling with resource sharing on heterogeneous multiprocessors (Q2251407) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) (Q2326400) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines (Q2884532) (← links)
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget (Q3004675) (← links)
- A unified approach to scheduling on unrelated parallel machines (Q3452224) (← links)
- Convex programming for scheduling unrelated parallel machines (Q3581397) (← links)
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines (Q4202586) (← links)
- Online Scheduling on a CPU-GPU Cluster (Q4922108) (← links)
- A desired load distribution model for scheduling of unrelated parallel machines (Q5478812) (← links)
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines (Q5696463) (← links)
- Automata, Languages and Programming (Q5716831) (← links)
- A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)
- Related machine scheduling with machine speeds satisfying linear constraints (Q5918518) (← links)
- Approximating scheduling unrelated parallel machines in parallel (Q5961071) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
