Pages that link to "Item:Q2481966"
From MaRDI portal
The following pages link to Semi-online scheduling on two uniform processors (Q2481966):
Displaying 14 items.
- Semi-online scheduling problems on two uniform machines under a grade of service provision (Q388114) (← links)
- Semi-online scheduling revisited (Q442235) (← 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)
- Online scheduling with a buffer on related machines (Q711400) (← links)
- Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
- Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← 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)
- General parametric scheme for the online uniform machine scheduling problem with two different speeds (Q1707972) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Dynamic scheduling of patients in emergency departments (Q6113312) (← links)
- Semi-online scheduling on two uniform parallel machines with initial lookahead (Q6594037) (← links)
