Pages that link to "Item:Q5937432"
From MaRDI portal
The following pages link to Randomized on-line scheduling on two uniform machines (Q5937432):
Displaying 50 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)
- 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)
- 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)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- Scheduling on two identical machines with a speed-up resource (Q1944144) (← links)
- Starting time minimization for the maximum job variant (Q2057591) (← links)
- Online scheduling of jobs with favorite machines (Q2289948) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← 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)
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- Semi-online scheduling with ``end of sequence'' information (Q2460107) (← 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)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
- Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time (Q6084675) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
