Pages that link to "Item:Q4095869"
From MaRDI portal
The following pages link to Exact and Approximate Algorithms for Scheduling Nonidentical Processors (Q4095869):
Displaying 50 items.
- Vertex cover meets scheduling (Q270025) (← links)
- 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)
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- Semi-online scheduling with known maximum job size on two uniform machines (Q613661) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- Performance of service policies in a specialized service system with parallel servers (Q940910) (← links)
- \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128) (← links)
- A comment on parallel-machine scheduling under a grade of service provision to minimize makespan (Q976111) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- Optimal location with equitable loads (Q1026600) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- Worst-case analysis of a scheduling algorithm (Q1060946) (← links)
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines (Q1061599) (← links)
- Richard Bellman's contributions to computer science (Q1081590) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- Scheduling on machines with variable service rates (Q1094326) (← links)
- Efficient scheduling of tasks without full use of processor resources (Q1145998) (← links)
- General approximation algorithms for some arithmetical combinatorial problems (Q1158970) (← links)
- A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
- A note on MULTIFIT scheduling for uniform machines (Q1272356) (← links)
- Unrelated parallel machine scheduling using local search (Q1341398) (← links)
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search (Q1362228) (← links)
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis (Q1622818) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- Min-max cover of a graph with a small number of parts (Q1751107) (← links)
- 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines (Q1799571) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- Off-line temporary tasks assignment. (Q1853487) (← links)
- Improving the complexities of approximation algorithms for optimization problems (Q1904613) (← links)
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
- Optimal collusion-resistant mechanisms with verification (Q2016253) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
