On-line machine covering

DOI<67::AID-JOS6>3.0.CO;2-Y 10.1002/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-YzbMath0909.90169MaRDI QIDQ5906280

Leah Epstein, Yossi Azar

Publication date: 1 November 1998

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(199808)1:2<67::aid-jos6>3.0.co;2-y

zbMATH Keywords

competitive ratio; randomized algorithm; load; parallel identical machines; machine covering; on-line

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Fair Packing of Independent Sets, Symmetry exploitation for online machine covering with bounded migration, Online Bounded Analysis, Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions, Machine covering in the random-order model, Online max-min fair allocation, Comparing the minimum completion times of two longest-first scheduling-heuristics, Online scheduling with rejection and reordering: exact algorithms for unit size jobs, Online algorithms with advice for bin packing and scheduling problems, Optimal semi-online preemptive algorithms for machine covering on two uniform machines, On-line machine covering on two machines with local migration, Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines, Optimal semi-online algorithms for machine covering, The hierarchical model for load balancing on two machines, Machine covering with combined partial information, Maximizing the minimum completion time on parallel machines, Semi-online machine covering for two uniform machines, Maximizing the minimum load for selfish agents, Online-bounded analysis, Improved approaches to the exact solution of the machine covering problem, Tight bounds for bandwidth allocation on two links, Semi-online scheduling jobs with tightly-grouped processing times on three identical machines, Fair allocation of indivisible items with conflict graphs, Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures