Semi-online machine covering on two uniform machines with known total size
type: Item
instance of: scholarly article
title: Semi-online machine covering on two uniform machines with known total size
zbMATH Open document ID: 1117.90039
author: N. E. Zubov
published in: Computing
publication date: 2007-01-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5082643
zbMATH Keywords: scheduling
zbMATH Keywords: design and analysis of algorithm
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: s00607-006-0187-x
OpenAlex ID: W1966332532
cites work: On-line bin-stretching
cites work: Semi-on-line multiprocessor scheduling with given total processing time
cites work: Tight bounds for bandwidth allocation on two links
cites work: Bin stretching revisited
cites work: Optimal non-preemptive semi-online scheduling on two related machines
cites work: Randomized on-line scheduling on two uniform machines
cites work: Semi on-line scheduling on two identical machines
cites work: Semi on-line algorithms for the partition problem
cites work: Semi-online scheduling with decreasing job sizes
cites work: Semi-on-line problems on two identical machines with combined partial information
DOI: 10.1007/S00607-006-0187-X
description: scientific article; zbMATH DE number 5082643