Online scheduling on three uniform machines
From MaRDI portal
Publication:765372
DOI10.1016/J.DAM.2011.10.001zbMATH Open1233.68234OpenAlexW2087172486MaRDI QIDQ765372FDOQ765372
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.001
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
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (4)
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)