Pages that link to "Item:Q3891758"

The following pages link to Bounds for List Schedules on Uniform Processors (Q3891758):

Displaying 50 items.

• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
• Semi-online scheduling with bounded job sizes on two uniform machines (Q338376) (← links)
• Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
• Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
• Smoothed performance guarantees for local search (Q403643) (← links)
• Coordination mechanisms with hybrid local policies (Q408369) (← links)
• The price of anarchy on uniformly related machines revisited (Q418148) (← links)
• Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
• Worst-case equilibria (Q458478) (← links)
• Semi-online scheduling on two uniform machines with the known largest size (Q491206) (← links)
• Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212) (← 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)
• A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
• Semi-online scheduling with known maximum job size on two uniform machines (Q613661) (← links)
• Competitive ratio of list scheduling on uniform machines and randomized heuristics (Q633543) (← links)
• Non-clairvoyant scheduling games (Q647492) (← links)
• On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
• Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
• A new algorithm for online uniform-machine scheduling to minimize the makespan (Q845691) (← links)
• Online algorithms for scheduling with machine activation cost on two uniform machines (Q886402) (← links)
• Deterministic monotone algorithms for scheduling on related machines (Q952439) (← links)
• Online scheduling with reassignment on two uniform machines (Q982662) (← links)
• Minmax scheduling problems with a common due-window (Q1000973) (← links)
• Coordination mechanisms for selfish scheduling (Q1014630) (← links)
• Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← links)
• Online scheduling with general machine cost functions (Q1026108) (← links)
• Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
• Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
• Efficient scheduling of tasks without full use of processor resources (Q1145998) (← links)
• Scheduling on uniform parallel machines to minimize maximum lateness (Q1577473) (← links)
• Online-bounded analysis (Q1617274) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• General parametric scheme for the online uniform machine scheduling problem with two different speeds (Q1707972) (← links)
• Bounds for parallel machine scheduling with predefined parts of jobs and setup time (Q1708539) (← links)
• Makespan minimization on uniform parallel machines with release times (Q1877043) (← links)
• List scheduling revisited (Q1919183) (← links)
• Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
• Online scheduling on uniform machines with two hierarchies (Q1928505) (← links)
• Starting time minimization for the maximum job variant (Q2057591) (← links)
• Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
• Online scheduling of jobs with favorite machines (Q2289948) (← links)
• Selfish load balancing for jobs with favorite machines (Q2294253) (← links)
• Improved price of anarchy for machine scheduling games with coordination mechanisms (Q2311122) (← links)
• A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
• The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
• Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
• A note on makespan minimization in two-stage flexible flow shops with uniform machines (Q2433488) (← links)
• Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
• Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)