Pages that link to "Item:Q1879359"

The following pages link to Approximation schemes for scheduling on uniformly related and identical parallel machines (Q1879359):

Displaying 36 items.

• Semi-online scheduling on two identical machines with rejection (Q385491) (← links)
• A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
• Optimal semi-online algorithm for scheduling with rejection on two uniform machines (Q411229) (← links)
• Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
• An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
• Scheduling with bully selfish jobs (Q692928) (← links)
• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines (Q817020) (← links)
• An approximation algorithm for identical parallel machine scheduling with resource dependent processing times (Q935202) (← links)
• Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
• Semi-online machine covering for two uniform machines (Q1034625) (← links)
• Approximation schemes for scheduling on parallel machines (Q1268852) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
• Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
• Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
• Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
• Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
• A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
• Scheduling with uncertain processing times in mixed-criticality systems (Q2315625) (← links)
• New approximation bounds for LPT scheduling (Q2379930) (← links)
• Scheduling with machine cost and rejection (Q2385470) (← links)
• A unified framework for designing EPTAS for load balancing on parallel machines (Q2415372) (← links)
• Online scheduling with machine cost and rejection (Q2462392) (← links)
• Approximations and auctions for scheduling batches on related machines (Q2643820) (← links)
• Approximate separable multichoice optimization over monotone systems (Q2673246) (← links)
• A unified approach to truthful scheduling on related machines (Q2800378) (← links)
• Approximation Algorithms For Scheduling On Uniform Processors (Q4202255) (← links)
• Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines (Q5074358) (← links)
• New Algorithmic Results for Bin Packing and Scheduling (Q5283351) (← links)
• Approximating Real-Time Scheduling on Identical Machines (Q5405072) (← links)
• Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
• Bag-Of-Tasks Scheduling on Related Machines (Q6070373) (← links)
• EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q6108926) (← links)
• Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)
• Approximation algorithms for job scheduling with block-type conflict graphs (Q6568400) (← links)