Pages that link to "Item:Q1006050"
From MaRDI portal
The following pages link to Two semi-online scheduling problems on two uniform machines (Q1006050):
Displaying 25 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)
- Online bin stretching with bunch techniques (Q497684) (← links)
- Semi-online scheduling with known maximum job size on two uniform machines (Q613661) (← links)
- An optimal semi-online algorithm for 2-machine scheduling with an availability constraint (Q719024) (← links)
- Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← 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)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← 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)
- Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines (Q1889769) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Semi-online scheduling on two uniform processors (Q2481966) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- (Q2766832) (← links)
- On-line and semi-online scheduling for flow shop problems on two machines (Q2841141) (← links)
- Geometric representation for semi on-line scheduling on uniform processors (Q3562411) (← links)
- (Q4252304) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time (Q6084675) (← links)
- Dynamic scheduling of patients in emergency departments (Q6113312) (← links)
- Semi-online scheduling on two uniform parallel machines with initial lookahead (Q6594037) (← links)