On-line machine covering on two machines with local migration

DOI10.1016/J.CAMWA.2011.07.020MaRDI QIDQ660883zbMATH OpenOpenAlexFDO

Authors Xufeng Chen, Sen Qin

Publication date 5 February 2012

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2011.07.020

zbMATH Keywords

competitive ratiomachine coveringon-line schedulingbounded migration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On-line machine covering
• On-line machine covering
• SEMI-ONLINE MACHINE COVERING
• Semi-online machine covering for two uniform machines
• Automata, Languages and Programming

Cites work

• scientific article; zbMATH DE number 5485443 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A Robust PTAS for Machine Covering and Packing
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• A robust APTAS for the classical bin packing problem
• Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
• On-line machine covering
• Online scheduling with bounded migration
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• The Santa Claus problem
• The exact LPT-bound for maximizing the minimum completion time
• Tight bounds for bandwidth allocation on two links

Cited in

(3)

• Approximation and Online Algorithms
• Semi-online machine covering for two uniform machines
• Symmetry Exploitation for Online Machine Covering with Bounded Migration

This page was built for publication: On-line machine covering on two machines with local migration

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