Tighter Bounds for LPT Scheduling on Uniform Processors
From MaRDI portal
Publication:3801059
DOI10.1137/0216037zbMath0654.68033OpenAlexW1986282189MaRDI QIDQ3801059
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216037
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
A survey on makespan minimization in semi-online environments ⋮ The shortest first coordination mechanism for a scheduling game with parallel-batching machines ⋮ A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem ⋮ Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ New approximation bounds for LPT scheduling ⋮ ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER ⋮ Coordination mechanisms for parallel machine scheduling ⋮ Worst-case analysis of LPT scheduling on a small number of non-identical processors ⋮ Strategic Scheduling Games: Equilibria and Efficiency ⋮ Bounds for parallel machine scheduling with predefined parts of jobs and setup time ⋮ Non-clairvoyant scheduling games ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ Parametric bounds for LPT scheduling on uniform processors ⋮ Online Makespan Scheduling with Job Migration on Uniform Machines ⋮ A Family of Scheduling Algorithms for Hybrid Parallel Platforms ⋮ A coordination mechanism for a scheduling game with parallel-batching machines ⋮ New efficiency results for makespan cost sharing ⋮ Related machine scheduling with machine speeds satisfying linear constraints ⋮ Coordination mechanisms for selfish scheduling ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ A note on MULTIFIT scheduling for uniform machines ⋮ Fair cost-sharing methods for scheduling jobs on parallel machines ⋮ Tighter approximation bounds for LPT scheduling in two special cases ⋮ Online makespan scheduling with job migration on uniform machines ⋮ Uniform machine scheduling with machine available constraints ⋮ Optimal and online preemptive scheduling on uniformly related machines ⋮ A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective ⋮ Optimal preemptive semi-online scheduling to minimize makespan on two related machines
