Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
From MaRDI portal
Recommendations
- Non-clairvoyant weighted flow time scheduling on different multi-processor models
- Non-clairvoyant scheduling for weighted flow time
- Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
- Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
- Weighted flow time bounds for scheduling identical processors
- Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
Cited in
(6)- Non-clairvoyant scheduling for weighted flow time
- Non-clairvoyant weighted flow time scheduling on different multi-processor models
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
- Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
- Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
- Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
This page was built for publication: Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896385)