Pages that link to "Item:Q1196214"

The following pages link to The exact LPT-bound for maximizing the minimum completion time (Q1196214):

Displaying 40 items.

• Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
• Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
• Parallel machine covering with limited number of preemptions (Q462268) (← 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)
• Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm (Q806667) (← 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)
• Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint (Q933069) (← links)
• \(k\)-partitioning problems with partition matroid constraint (Q1022585) (← 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)
• Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times (Q1271384) (← links)
• A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
• The optimal on-line parallel machine scheduling (Q1568731) (← links)
• LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
• \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← links)
• MapReduce machine covering problem on a small number of machines (Q2279746) (← links)
• Simultaneous approximation ratios for parallel machine scheduling problems (Q2326082) (← 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)
• General max-min fair allocation (Q2695275) (← links)
• Parallel machine scheduling problems with proportionally deteriorating jobs (Q3612784) (← links)
• A variation of Graham's LPT-algorithm (Q3989473) (← links)
• (Q4368203) (← links)
• Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
• Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
• SEMI-ONLINE MACHINE COVERING (Q5295439) (← links)
• SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES (Q5315986) (← links)
• Maximizing the Minimum Load for Selfish Agents (Q5458534) (← links)
• Semi-on-line scheduling problems for maximizing the minimum machine completion time (Q5931905) (← links)
• Mixed coordination mechanisms for scheduling games on hierarchical machines (Q6070429) (← links)
• Polynomial-time combinatorial algorithm for general max-min fair allocation (Q6182677) (← links)