Pages that link to "Item:Q2489955"
From MaRDI portal
The following pages link to Optimal on-line flow time with resource augmentation (Q2489955):
Displaying 9 items.
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- From Preemptive to Non-preemptive Scheduling Using Rejections (Q2817893) (← links)
- Speed is as powerful as clairvoyance (Q4406304) (← links)
- (Q4782742) (← links)
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625) (← links)
- Approximation and Online Algorithms (Q5896926) (← links)
- Optimal time-critical scheduling via resource augmentation (Q5957573) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines (Q6487363) (← links)