Machine covering with combined partial information
type: Item
instance of: scholarly article
title: Machine covering with combined partial information
zbMATH Open document ID: 1186.90057
author: Yong Wu
author: Yikun Huang
author: Qifan Yang
published in: Journal of Statistical Planning and Inference
publication date: 2010-05-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5710823
zbMATH Keywords: scheduling
zbMATH Keywords: design and analysis of algorithm
zbMATH Keywords: semi-online
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: j.jspi.2010.01.030
OpenAlex ID: W2039434112
cites work: On-line machine covering
cites work: On-line bin-stretching
cites work: Semi-on-line multiprocessor scheduling with given total processing time
cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
cites work: Semi-online algorithms for parallel machine scheduling problems
cites work: Tight bounds for bandwidth allocation on two links
cites work: Approximation and Online Algorithms
cites work: Semi on-line scheduling on two identical machines
cites work: Semi on-line algorithms for the partition problem
cites work: Semi-online machine covering on two uniform machines with known total size
cites work: Semi-on-line problems on two identical machines with combined partial information
cites work: Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
cites work: Optimal semi-online algorithms for machine covering
cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time
DOI: 10.1016/J.JSPI.2010.01.030
description: scientific article; zbMATH DE number 5710823