On-line machine covering on two machines with local migration

DOI10.1016/j.camwa.2011.07.020zbMath1231.90181OpenAlexW1984497579MaRDI QIDQ660883

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 ratioon-line schedulingmachine coveringbounded migration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Tight bounds for bandwidth allocation on two links
• The Santa Claus problem
• Online Scheduling with Bounded Migration
• A Robust PTAS for Machine Covering and Packing
• 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

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