Preemptive online algorithms for scheduling with machine cost
type: Item
instance of: scholarly article
title: Preemptive online algorithms for scheduling with machine cost
zbMATH Open document ID: 1143.90335
author: Yiwei Jiang
author: Yong He
published in: Acta Informatica
publication date: 2005-05-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 2168050
MaRDI profile type: Publication
full work available at URL: s00236-004-0156-9
OpenAlex ID: W2092031801
cites work: An optimal algorithm for preemptive on-line scheduling
cites work: Better Online Algorithms for Scheduling with Machine Cost
cites work: Semi-online algorithms for parallel machine scheduling problems
cites work: Bin stretching revisited
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Semi-online scheduling with machine cost.
cites work: Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
cites work: Semi on-line scheduling on two identical machines
cites work: Q4941834
cites work: Semi on-line algorithms for the partition problem
cites work: A guessing game and randomized online algorithms
DOI: 10.1007/S00236-004-0156-9
description: scientific article; zbMATH DE number 2168050