Minimizing Maximum Flow-time on Related Machines
From MaRDI portal
Recommendations
- Minimizing maximum flow-time on related machines
- Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
- Minimizing maximum (weighted) flow-time on related and unrelated machines
- Minimizing average flow time on related machines
- Minimizing flow-time on unrelated machines
- On minimizing the total flow time on multiple machines
- Minimizing Average Flow Time on Unrelated Machines
- Better Algorithms for Minimizing Average Flow-Time on Related Machines
- Minimizing flow time on a constant number of machines with preemption
- scientific article; zbMATH DE number 10435
Cited in
(10)- Minimizing maximum flow-time on related machines
- Minimizing average flow time on related machines
- Minimizing flow-time on unrelated machines
- SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
- Better Algorithms for Minimizing Average Flow-Time on Related Machines
- Minimizing maximum flow time on related machines via dynamic posted pricing
- Minimizing maximum (weighted) flow-time on related and unrelated machines
- Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
- scientific article; zbMATH DE number 6469165 (Why is no real title available?)
- Scheduling to minimize max flow time: offline and online algorithms.
This page was built for publication: Minimizing Maximum Flow-time on Related Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5351891)