Pages that link to "Item:Q491206"
From MaRDI portal
The following pages link to Semi-online scheduling on two uniform machines with the known largest size (Q491206):
Displaying 13 items.
- 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)
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212) (← links)
- A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size (Q511074) (← links)
- Semi-online scheduling with known maximum job size on two uniform machines (Q613661) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Semi-online machine covering on two uniform machines with known total size (Q858190) (← links)
- Two semi-online scheduling problems on two uniform machines (Q1006050) (← links)
- Semi on-line scheduling on two identical machines (Q1300219) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
- Semi-online scheduling on two uniform parallel machines with initial lookahead (Q6594037) (← links)
