Pages that link to "Item:Q5937432"

The following pages link to Randomized on-line scheduling on two uniform machines (Q5937432):

Displaying 30 items.

• On-line scheduling on parallel machines to minimize the makespan (Q328085) (← links)
• Semi-online scheduling with bounded job sizes on two uniform machines (Q338376) (← links)
• Semi-online scheduling problems on two uniform machines under a grade of service provision (Q388114) (← 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)
• Optimal semi-online algorithm for scheduling with rejection on two uniform machines (Q411229) (← links)
• Robust algorithms for preemptive scheduling (Q472464) (← 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)
• 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)
• A note on hierarchical scheduling on two uniform machines (Q604878) (← 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)
• Online scheduling with rejection and withdrawal (Q650898) (← links)
• On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
• Online scheduling with a buffer on related machines (Q711400) (← links)
• Online scheduling on three uniform machines (Q765372) (← 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)
• Semi-online machine covering on two uniform machines with known total size (Q858190) (← links)
• Online algorithms for scheduling with machine activation cost on two uniform machines (Q886402) (← 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)
• Online scheduling with reassignment on two uniform machines (Q982662) (← links)
• Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← links)
• Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
• Online-bounded analysis (Q1617274) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)