Preemptive on-line scheduling for two uniform processors

From MaRDI portal
Publication:1306385

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




Related Items (27)

Optimal preemptive semi-online scheduling on two uniform processorsOnline Hierarchical Scheduling on Two Uniform Machines with Bounded Job SizesSeparating online scheduling algorithms with the relative worst order ratioPreemptive online scheduling with rejection of unit jobs on two uniformly related machinesUnnamed ItemGeneral parametric scheme for the online uniform machine scheduling problem with two different speedsPreemptive scheduling on a small number of hierarchical machinesOptimal on-line algorithms to minimize makespan on two machines with resource augmentationRobust algorithms for preemptive schedulingA lower bound for on-line scheduling on uniformly related machinesSemi-online scheduling on two uniform machines with the known largest sizeOptimal semi-online algorithms for preemptive scheduling problems with inexact partial informationOn the optimality of list scheduling for online uniform machines schedulingSemi-online scheduling on two uniform processorsSemi-online preemptive scheduling: one algorithm for all variantsRandomized on-line scheduling on two uniform machinesOptimal semi-online preemptive algorithms for machine covering on two uniform machinesOptimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratiosOPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINESPreemptive online scheduling: Optimal algorithms for all speedsOnline scheduling on two uniform machines to minimize the makespanOptimal and online preemptive scheduling on uniformly related machinesOptimal online algorithms for MapReduce scheduling on two uniform machinesOn-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machinesPreemptive machine covering on parallel machinesOptimal preemptive semi-online scheduling to minimize makespan on two related machinesPreemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines




Cites Work




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