Improved Bounds for the Online Scheduling Problem
From MaRDI portal
Publication:4706228
DOI10.1137/S0097539702403438zbMath1023.90031MaRDI QIDQ4706228
John F. Rudin III, R. Chandrasekaran
Publication date: 19 June 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Simultaneously load balancing for every p-norm, with reassignments, Unnamed Item, Online Makespan Scheduling with Job Migration on Uniform Machines, Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming, Parallel solutions for preemptive makespan scheduling on two identical machines, Improved approximation algorithms for multiprocessor scheduling with testing, An on-line scheduling problem of parallel machines with common maintenance time, Semi-online scheduling problems on a small number of machines, New upper and lower bounds for online scheduling with machine cost, Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs, Semi-online scheduling revisited, Online algorithms with advice for bin packing and scheduling problems, Online scheduling with rearrangement on two related machines, Scheduling unit length jobs on parallel machines with lookahead information, On the optimality of list scheduling for online uniform machines scheduling, Improved bounds for online scheduling with eligibility constraints, List's worst-average-case or WAC ratio, Online parallel machines scheduling with two hierarchies, Online scheduling with reassignment, Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead, A survey on makespan minimization in semi-online environments, Improved lower bounds for online scheduling to minimize total stretch, Online scheduling of two job types on a set of multipurpose machines with unit processing times, Pseudo lower bounds for online parallel machine scheduling, Offline file assignments for online load balancing, Scheduling In the random-order model, Online makespan scheduling with job migration on uniform machines, Online load balancing with general reassignment cost, Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing, Online makespan minimization with parallel schedules, Improved lower bounds for the online bin stretching problem, On the value of job migration in online makespan minimization, A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME, ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER, Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures, ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
