On-line machine covering on two machines with local migration

DOI10.1016/J.CAMWA.2011.07.020zbMATH Open1231.90181OpenAlexW1984497579MaRDI QIDQ660883FDOQ660883

Sen Qin, Xufeng Chen

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A robust APTAS for the classical bin packing problem
• The exact LPT-bound for maximizing the minimum completion time
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• The Santa Claus problem
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
• On-line machine covering
• A Robust PTAS for Machine Covering and Packing
• Tight bounds for bandwidth allocation on two links
• Online Scheduling with Bounded Migration

Cited In (2)

• Approximation and Online Algorithms
• Semi-online machine covering for two uniform machines

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)