Pages that link to "Item:Q613661"
From MaRDI portal
The following pages link to Semi-online scheduling with known maximum job size on two uniform machines (Q613661):
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)
- 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 scheduling with known partial information about job sizes on two identical machines (Q551204) (← 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)
- Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines (Q862993) (← links)
- Two semi-online scheduling problems on two uniform machines (Q1006050) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
- Preemptive semi-online algorithms for parallel machine scheduling with known total size (Q2508575) (← links)
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)