Pages that link to "Item:Q5009625"
From MaRDI portal
The following pages link to Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625):
Displaying 4 items.
- Non-clairvoyant scheduling for weighted flow time (Q1014388) (← links)
- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models (Q2896385) (← links)
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines (Q6487363) (← links)