The following pages link to Online scheduling with reassignment (Q935241):
Displaying 16 items.
- Semi-online scheduling on two identical machines with rejection (Q385491) (← links)
- 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)
- Online scheduling with reassignment on two uniform machines (Q982662) (← links)
- Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines (Q1944914) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online NDP-constraint scheduling of jobs with delivery times or weights (Q2693783) (← links)
- ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER (Q2929632) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
