Pages that link to "Item:Q1362519"

The following pages link to A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519):

Displaying 50 items.

• Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
• A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines (Q342416) (← links)
• A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
• Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
• An on-line scheduling problem of parallel machines with common maintenance time (Q394448) (← links)
• Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
• Parallel machine covering with limited number of preemptions (Q462268) (← 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)
• Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
• A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size (Q511074) (← links)
• Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
• On-line machine covering on two machines with local migration (Q660883) (← links)
• Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
• Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines (Q862993) (← links)
• Optimal semi-online algorithms for machine covering (Q870840) (← links)
• Machine covering with combined partial information (Q972842) (← links)
• Maximizing the minimum completion time on parallel machines (Q1029565) (← links)
• Semi-online machine covering for two uniform machines (Q1034625) (← links)
• Maximizing the minimum load for selfish agents (Q1041221) (← links)
• The optimal on-line parallel machine scheduling (Q1568731) (← links)
• Online-bounded analysis (Q1617274) (← links)
• On maximin share allocations in matroids (Q1628590) (← links)
• Approximate maximin shares for groups of agents (Q1748541) (← links)
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
• In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
• Approximation algorithms for simple assembly line balancing problems (Q2125223) (← links)
• Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness (Q2152111) (← links)
• The fair division of hereditary set systems (Q2190407) (← links)
• Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
• Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
• An improved approximation algorithm for maximin shares (Q2238718) (← links)
• Maximin share guarantee for goods with positive externalities (Q2244422) (← links)
• MapReduce machine covering problem on a small number of machines (Q2279746) (← links)
• A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
• A new approach for bicriteria partitioning problem (Q2355323) (← links)
• Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
• A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
• Tight bounds for bandwidth allocation on two links (Q2486751) (← links)
• Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
• Preemptive machine covering on parallel machines (Q2583174) (← links)
• Computing fair and efficient allocations with few utility values (Q2670939) (← links)
• Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
• General max-min fair allocation (Q2695275) (← links)
• Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
• A Unified Approach to Truthful Scheduling on Related Machines (Q2800378) (← links)
• A Protocol for Cutting Matroids Like Cakes (Q2937759) (← links)
• GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE (Q2997922) (← links)
• Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
• Approximation Algorithms for Computing Maximin Share Allocations (Q3448772) (← links)