Preemptive on-line scheduling for two uniform processors
From MaRDI portal
Publication:1306385
DOI10.1016/S0167-6377(98)00032-7zbMATH Open0957.90066OpenAlexW2046608953MaRDI QIDQ1306385FDOQ1306385
Authors: Jianjun Wen, Donglei 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
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
Cited In (37)
- Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes
- On-line and off-line preemptive two-machine job shop scheduling
- Optimal Preemptive Scheduling of Two Unrelated Processors
- 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
- Title not available (Why is that?)
- Semi-online preemptive scheduling: one algorithm for all variants
- On the optimality of list scheduling for online uniform machines scheduling
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Online scheduling on two uniform machines to minimize the makespan
- 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
- Title not available (Why is that?)
- A lower bound for on-line scheduling on uniformly related machines
- Title not available (Why is that?)
- Optimal preemptive online scheduling to minimize \(l_p\) norm on two processors
- Semi-online scheduling on two uniform processors
- On the two-phase method for preemptive scheduling
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
- Preemptive scheduling on a small number of hierarchical machines
- Robust algorithms for preemptive scheduling
- Randomized on-line scheduling on two uniform machines
- OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
- Optimal and online preemptive scheduling on uniformly related machines
- On-line bin packing with two item sizes
- Optimal preemptive semi-online scheduling on two uniform processors
- 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
- Preemptive machine covering on parallel machines
- Optimal online algorithms for MapReduce scheduling on two uniform machines
- Semi-online scheduling on two uniform machines with the known largest size
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)
