On-line machine covering on two machines with local migration
type: Item
instance of: scholarly article
title: On-line machine covering on two machines with local migration
zbMATH Open document ID: 1231.90181
author: Xufeng Chen
author: Sen Qin
publication date: 2012-02-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6003415
zbMATH Keywords: on-line scheduling
zbMATH Keywords: machine covering
zbMATH Keywords: competitive ratio
zbMATH Keywords: bounded migration
MaRDI profile type: Publication
full work available at URL: j.camwa.2011.07.020
OpenAlex ID: W1984497579
cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
cites work: Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
cites work: Q4223058
cites work: On-line machine covering
cites work: Tight bounds for bandwidth allocation on two links
cites work: The exact LPT-bound for maximizing the minimum completion time
cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time
cites work: Online Scheduling with Bounded Migration
cites work: A robust APTAS for the classical bin packing problem
cites work: A Robust PTAS for Machine Covering and Packing
cites work: The Santa Claus problem
cites work: Q3549603
DOI: 10.1016/J.CAMWA.2011.07.020
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 6003415