Pages that link to "Item:Q491212"
From MaRDI portal
The following pages link to Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212):
Displaying 7 items.
- Semi-online scheduling problems on two uniform machines under a grade of service provision (Q388114) (← links)
- Online bin stretching with bunch techniques (Q497684) (← 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)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time (Q6084675) (← links)