Pages that link to "Item:Q1944914"
From MaRDI portal
The following pages link to Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines (Q1944914):
Displaying 12 items.
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
- An optimal semi-online algorithm for 2-machine scheduling with an availability constraint (Q719024) (← links)
- Online scheduling with reassignment on two uniform machines (Q982662) (← 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)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- (Q3170969) (← links)
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)