On-line machine covering

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-Y" /><67::AID-JOS6>3.0.CO;2-Y 10.1002/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-YzbMath0909.90169OpenAlexW2011643166MaRDI 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 ratiorandomized algorithmloadparallel identical machinesmachine coveringon-line

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (24)

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

This page was built for publication: On-line machine covering