New lower and upper bounds for on-line scheduling
From MaRDI portal
Publication:1892104
DOI10.1016/0167-6377(94)90071-XzbMath0823.90059OpenAlexW1996869102MaRDI QIDQ1892104
André van Vliet, Bo Chen, Gerhard J. Woeginger
Publication date: 6 July 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)90071-x
Related Items
A survey on makespan minimization in semi-online environments, List's worst-average-case or WAC ratio, Online parallel machines scheduling with two hierarchies, New lower and upper bounds for on-line scheduling, On two dimensional packing, Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing, Semi-online scheduling: a survey, Randomized algorithms for that ancient scheduling problem, Semi-online scheduling problems on a small number of machines, Lower bounds for online makespan minimization on a small number of related machines, Improved upper bounds for online malleable job scheduling, Online hierarchical scheduling: an approach using mathematical programming, Improved approximation algorithms for multiprocessor scheduling with testing, Improved algorithm for a generalized on-line scheduling problem on identical machines, Unnamed Item, Online scheduling with rejection and withdrawal, Scheduling unit length jobs on parallel machines with lookahead information, Online scheduling with rejection and reordering: exact algorithms for unit size jobs, Online Makespan Scheduling with Job Migration on Uniform Machines, Optimal on-line algorithms for single-machine scheduling, Semi-online scheduling with decreasing job sizes, On the optimality of list scheduling for online uniform machines scheduling, Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines, Online scheduling of two job types on a set of multipurpose machines with unit processing times, Randomized on-line scheduling on two uniform machines, Worst-case analysis for on-line service policies, Improved bounds for online scheduling with eligibility constraints, Pseudo lower bounds for online parallel machine scheduling, Preemptive multiprocessor scheduling with rejection, On-line bin-stretching, An optimal online algorithm for scheduling two machines with release times, Online makespan scheduling with job migration on uniform machines, A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model, Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming, Restarts can help in the on-line minimization of the maximum delivery time on a single machine, On-line scheduling revisited
Cites Work
