Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
type: Item
instance of: scholarly article
title: Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
zbMATH Open document ID: 1260.68497
author: Xiao Min
author: Jing Liu
author: Yuqing Wang
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6149199
zbMATH Keywords: scheduling
zbMATH Keywords: reassignment
zbMATH Keywords: competitive ratio
zbMATH Keywords: optimal algorithm
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.01.002
OpenAlex ID: W2053402898
cites work: Online scheduling with reassignment
cites work: Q4710111
cites work: Q4472662
cites work: Online scheduling on two uniform machines to minimize the makespan
cites work: Online scheduling with reassignment on two uniform machines
cites work: Online scheduling with rearrangement on two related machines
cites work: Online Scheduling with Bounded Migration
cites work: Semi-on-line problems on two identical machines with combined partial information
cites work: A note on on-line scheduling with partial information
cites work: Semi-online algorithms for parallel machine scheduling problems
DOI: 10.1016/J.IPL.2011.01.002
description: scientific article; zbMATH DE number 6149199