Optimal non-preemptive semi-online scheduling on two related machines
From MaRDI portal
Publication:5704856
DOI10.1016/j.jalgor.2004.11.002zbMath1101.68410OpenAlexW1969305723MaRDI QIDQ5704856
Leah Epstein, Lene Monrad Favrholdt
Publication date: 16 November 2005
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.11.002
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (13)
A survey on makespan minimization in semi-online environments ⋮ A modified LPT algorithm for the two uniform parallel machine makespan minimization problem ⋮ Semi-online machine covering on two uniform machines with known total size ⋮ Semi-online scheduling with bounded job sizes on two uniform machines ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling with known maximum job size on two uniform machines ⋮ Parallel solutions for preemptive makespan scheduling on two identical machines ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ Semi-online scheduling with ``end of sequence information ⋮ Semi-online scheduling on two uniform machines with the known largest size ⋮ Algorithms better than LPT for semi-online scheduling with decreasing processing times ⋮ Online scheduling with a buffer on related machines ⋮ Semi-online machine covering for two uniform machines
This page was built for publication: Optimal non-preemptive semi-online scheduling on two related machines
