Symmetry Exploitation for Online Machine Covering with Bounded Migration

DOI10.1145/3397535MaRDI QIDQ5888934zbMATH OpenOpenAlexFDO

Authors Waldo Gálvez, José A. Soto, José Verschae

Publication date 26 April 2023

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3397535

zbMATH Keywords

bounded migrationLPTmachine coveringonlinescheduling

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Symmetry exploitation for online machine covering with bounded migration
• On-line machine covering on two machines with local migration
• Online Bin Covering with Limited Migration
• Automata, Languages and Programming
• Online scheduling with bounded migration

Cited in

(9)

• Online bin covering with limited migration
• Symmetry exploitation for online machine covering with bounded migration
• Online Bin Covering with Limited Migration
• Bin stretching with migration on two hierarchical machines
• Machine covering in the random-order model
• Online load balancing on uniform machines with limited migration
• Online max-min fair allocation
• Online minimization of the maximum starting time: migration helps
• Robust scheduling on uniform machines. New results using a relaxed approximation guarantee

This page was built for publication: Symmetry Exploitation for Online Machine Covering with Bounded Migration

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