Recommendations
- Preemptive online algorithms for scheduling on three machines with hierarchies
- Optimal online algorithms for hierarchical scheduling on three parallel machines
- Online scheduling of unit jobs on three machines with rejection: a tight result
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies
- SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES
- Online batch scheduling problem on uniform machines with agreeable processing times
- Online scheduling on uniform machines with two hierarchies
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
- scientific article; zbMATH DE number 6671683
Cites work
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- A new algorithm for online uniform-machine scheduling to minimize the makespan
- An On-Line Algorithm for Some Uniform Processor Scheduling
- Bounds on Multiprocessing Timing Anomalies
- Randomized on-line scheduling on two uniform machines
Cited in
(4)- Lower bounds for online makespan minimization on a small number of related machines
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- scientific article; zbMATH DE number 5525401 (Why is no real title available?)
- scientific article; zbMATH DE number 6671683 (Why is no real title available?)
This page was built for publication: Online scheduling on three uniform machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765372)
