The following pages link to (Q3170969):
Displaying 4 items.
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- Online scheduling with reassignment on two uniform machines (Q982662) (← links)
- Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines (Q1944914) (← links)