Pages that link to "Item:Q5949924"
From MaRDI portal
The following pages link to Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924):
Displaying 12 items.
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
- Parallel machine covering with limited number of preemptions (Q462268) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← 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)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
- Preemptive machine covering on parallel machines (Q2583174) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
