Pages that link to "Item:Q1306385"

The following pages link to Preemptive on-line scheduling for two uniform processors (Q1306385):

Displaying 27 items.

• Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
• Robust algorithms for preemptive scheduling (Q472464) (← links)
• Semi-online scheduling on two uniform machines with the known largest size (Q491206) (← links)
• Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
• Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
• On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines (Q817020) (← links)
• Optimal preemptive semi-online scheduling on two uniform processors (Q834944) (← links)
• Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
• Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
• Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
• Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← links)
• Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
• General parametric scheme for the online uniform machine scheduling problem with two different speeds (Q1707972) (← links)
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
• A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
• Optimal online algorithms for MapReduce scheduling on two uniform machines (Q2329682) (← links)
• On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
• Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
• Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
• Semi-online scheduling on two uniform processors (Q2481966) (← links)
• Preemptive machine covering on parallel machines (Q2583174) (← links)
• OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES (Q3379505) (← links)
• Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
• (Q5009506) (← links)
• Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
• Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)