Pages that link to "Item:Q627161"
From MaRDI portal
The following pages link to Online scheduling with rearrangement on two related machines (Q627161):
Displaying 15 items.
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← 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)
- Semi-online hierarchical scheduling problems with buffer or rearrangements (Q1943630) (← 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)
- Online interval scheduling on two related machines: the power of lookahead (Q2424805) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online minimum makespan scheduling with a buffer (Q2929632) (← links)
- (Q3170969) (← links)
- Online Order Scheduling Problem with the Same Order Size on Two Identical Machines (Q4978463) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- Semi-online scheduling on two uniform parallel machines with initial lookahead (Q6594037) (← links)