Pages that link to "Item:Q751989"
From MaRDI portal
The following pages link to Approximation algorithms for scheduling unrelated parallel machines (Q751989):
Displaying 50 items.
- Stochastic Load Balancing on Unrelated Machines (Q4991668) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- (Q5009585) (← links)
- Task scheduling in networks (Q5054769) (← links)
- Online load balancing of temporary tasks (Q5060106) (← links)
- Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
- Simpler and Better Algorithms for Minimum-Norm Load Balancing (Q5075764) (← links)
- (Q5075832) (← links)
- (Q5091233) (← links)
- On-line scheduling of parallel jobs (Q5096875) (← links)
- On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- Optimal matroid partitioning problems (Q5136271) (← links)
- A Quasi-Polynomial Approximation for the Restricted Assignment Problem (Q5138780) (← links)
- (Q5159440) (← links)
- Lazy Local Search Meets Machine Scheduling (Q5237306) (← links)
- Compact LP Relaxations for Allocation Problems (Q5240426) (← links)
- Approximating Scheduling Machines with Capacity Constraints (Q5321720) (← links)
- Improved Lower Bounds for Non-utilitarian Truthfulness (Q5443369) (← links)
- The Influence of Link Restrictions on (Random) Selfish Routing (Q5459969) (← links)
- Complexity of preemptive minsum scheduling on unrelated parallel machines (Q5704855) (← links)
- Automata, Languages and Programming (Q5716831) (← links)
- (Q5743405) (← links)
- (Q5875469) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5891543) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901311) (← links)
- Computing Nash equilibria for scheduling on restricted parallel links (Q5917951) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)
- Related machine scheduling with machine speeds satisfying linear constraints (Q5918518) (← links)
- Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098) (← links)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
- Scheduling experiments on a nulear reactor using mixed integer programming (Q5945333) (← links)
- Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility (Q5952430) (← links)
- Approximating scheduling unrelated parallel machines in parallel (Q5961071) (← links)
- Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection (Q6053501) (← links)
- EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
- On competitive analysis for polling systems (Q6072151) (← links)
- Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)
- Malleable scheduling beyond identical machines (Q6090217) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q6108926) (← links)
- Competitive algorithms for demand response management in a smart grid (Q6124769) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
