Pages that link to "Item:Q751989"
From MaRDI portal
The following pages link to Approximation algorithms for scheduling unrelated parallel machines (Q751989):
Displayed 50 items.
- Vertex cover meets scheduling (Q270025) (← links)
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929) (← links)
- Performance guarantees for scheduling algorithms under perturbed machine speeds (Q496438) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Improved lower bounds for non-utilitarian truthfulness (Q627119) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Dynamic scheduling for heterogeneous desktop grids (Q666261) (← links)
- A note on the prize collecting traveling salesman problem (Q687042) (← links)
- The efficiency of fair division (Q692886) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← links)
- Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- No-wait scheduling in single-hop multi-channel lans (Q834980) (← links)
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs (Q845858) (← links)
- Machine scheduling with resource dependent processing times (Q877194) (← links)
- Minimizing average flow-time under knapsack constraint (Q896150) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- The price of envy-freeness in machine scheduling (Q899310) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
- On the approximation of the single source \(k\)-splittable flow problem (Q935843) (← links)
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
- Online scheduling on parallel machines with two goS levels (Q941832) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← 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)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)