Preemptive on-line scheduling for two uniform processors

DOI10.1016/S0167-6377(98)00032-7zbMath0957.90066OpenAlexW2046608953MaRDI QIDQ1306385

Jianjun Wen, Dong-lei Du

Publication date: 1998

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00032-7

zbMATH Keywords

competitive ratiopreemptionuniform processorsone-line scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (27)

Optimal preemptive semi-online scheduling on two uniform processors ⋮ Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes ⋮ Separating online scheduling algorithms with the relative worst order ratio ⋮ Preemptive online scheduling with rejection of unit jobs on two uniformly related machines ⋮ Unnamed Item ⋮ General parametric scheme for the online uniform machine scheduling problem with two different speeds ⋮ Preemptive scheduling on a small number of hierarchical machines ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ Robust algorithms for preemptive scheduling ⋮ A lower bound for on-line scheduling on uniformly related machines ⋮ Semi-online scheduling on two uniform machines with the known largest size ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ On the optimality of list scheduling for online uniform machines scheduling ⋮ Semi-online scheduling on two uniform processors ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ Randomized on-line scheduling on two uniform machines ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines ⋮ Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios ⋮ OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES ⋮ Preemptive online scheduling: Optimal algorithms for all speeds ⋮ Online scheduling on two uniform machines to minimize the makespan ⋮ Optimal and online preemptive scheduling on uniformly related machines ⋮ Optimal online algorithms for MapReduce scheduling on two uniform machines ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines ⋮ Preemptive machine covering on parallel machines ⋮ Optimal preemptive semi-online scheduling to minimize makespan on two related machines ⋮ Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines

Cites Work

• Competitive snoopy caching
• An optimal algorithm for preemptive on-line scheduling
• Preemptive Scheduling of Uniform Processor Systems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Preemptive on-line scheduling for two uniform processors