Preemptive on-line scheduling for two uniform processors

Recommendations

Optimal preemptive semi-online scheduling on two uniform processors
On-line preemptive scheduling on uniform machines
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Semi-online scheduling on two uniform processors
Optimal Preemptive Scheduling of Two Unrelated Processors
Preemptive stochastic online scheduling on two uniform machines
Online scheduling of parallel jobs with preemption on two identical machines
Ideal preemptive schedules on two processors
Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
An On-Line Algorithm for Some Uniform Processor Scheduling

Cites work

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

Cited in

(38)

On-line and off-line preemptive two-machine job shop scheduling
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
Optimal Preemptive Scheduling of Two Unrelated Processors
Semi-online preemptive scheduling: one algorithm for all variants
On the optimality of list scheduling for online uniform machines scheduling
Online scheduling on two uniform machines to minimize the makespan
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Online scheduling of two uniform machines to minimize total completion times
Preemptive online scheduling: Optimal algorithms for all speeds
On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
General parametric scheme for the online uniform machine scheduling problem with two different speeds
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
On-line preemptive scheduling on uniform machines
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
scientific article; zbMATH DE number 1817675 (Why is no real title available?)
A lower bound for on-line scheduling on uniformly related machines
scientific article; zbMATH DE number 1688367 (Why is no real title available?)
Optimal preemptive online scheduling to minimize \(l_p\) norm on two processors
On the two-phase method for preemptive scheduling
Semi-online scheduling on two uniform processors
Online makespan minimization: the power of restart
Preemptive scheduling on a small number of hierarchical machines
Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
Robust algorithms for preemptive scheduling
OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
Randomized on-line scheduling on two uniform machines
An on-line algorithm for some uniform processor Scheduling
Online hierarchical scheduling on two uniform machines with bounded job sizes
Optimal and online preemptive scheduling on uniformly related machines
Optimal preemptive semi-online scheduling on two uniform processors
On-line bin packing with two item sizes
Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ℓ p Norm
Separating online scheduling algorithms with the relative worst order ratio
Semi-online scheduling on two uniform machines with the known largest size
Preemptive machine covering on parallel machines
Optimal online algorithms for MapReduce scheduling on two uniform machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306385)