Pages that link to "Item:Q982662"
From MaRDI portal
The following pages link to Online scheduling with reassignment on two uniform machines (Q982662):
Displaying 16 items.
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- Online scheduling with rearrangement on two related machines (Q627161) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← 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)
- General parametric scheme for the online uniform machine scheduling problem with two different speeds (Q1707972) (← links)
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines (Q1944914) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- (Q2766832) (← links)
- (Q3170969) (← links)
- Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint (Q3578374) (← links)
- (Q4252304) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)