On-line machine covering

DOI10.1002/(SICI)1099-1425(199808)1:2%3C67::AID-JOS6%3E3.0.CO;2-YMaRDI QIDQ5906280zbMATH OpenOpenAlexFDO

Authors Yossi Azar, Leah Epstein

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%3C67::aid-jos6%3E3.0.co;2-y

zbMATH Keywords

competitive ratioloadmachine coveringon-lineparallel identical machinesrandomized algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On-line machine covering
• New algorithms for an ancient scheduling problem.
• Preemptive machine covering on parallel machines
• Approximation and Online Algorithms
• Randomized on-line and semi-on-line scheduling on identical machines

Cited in

(30)

• 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
• Online variable sized covering
• 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
• Preemptive machine covering on parallel machines
• Fair allocation of indivisible items with conflict graphs
• scientific article; zbMATH DE number 6696496 (Why is no real title available?)
• 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
• 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
• Fair Packing of Independent Sets
• Optimal semi-online preemptive algorithms for machine covering on two uniform machines
• Online bounded analysis
• On-line 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
• On-line machine covering on two machines with local migration
• Semi-online machine covering problem on three hierarchical machines with bounded processing times
• Online speed-robust scheduling
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5906280)