On-line machine covering

DOI10.1007/3-540-63397-9_3zbMATH Open1477.90017OpenAlexW2154716867MaRDI QIDQ5896852FDOQ5896852

Authors: Yossi Azar, Leah Epstein 

Publication date: 20 December 2021

Published in: Algorithms — ESA '97 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63397-9_3

Recommendations

• On-line machine covering
• Randomized on-line scheduling on two uniform machines
• New algorithms for an ancient scheduling problem.
• Preemptive machine covering on parallel machines
• On-Line Load Balancing for Related Machines

zbMATH Keywords

competitive ratiooptimal assignmentcompetitive algorithmidentical machineminimum load

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Deterministic scheduling theory in operations research (90B35)

Cited In (12)

• Online variable sized covering
• Competitive Algorithms for Cottage Rental
• On the on-line maintenance scheduling problem
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
• Semi-on-line scheduling problems for maximizing the minimum machine completion time
• On-line load balancing for related machines
• Randomized on-line and semi-on-line scheduling on identical machines
• Fair division of indivisible goods: recent progress and open questions
• On-line machine covering on two machines with local migration
• Maximizing the Minimum Load for Selfish Agents
• Title not available (Why is that?)
• Preemptive machine covering on parallel machines

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 Q5896852)