Pseudo lower bounds for online parallel machine scheduling
type: Item
instance of: scholarly article
title: Pseudo lower bounds for online parallel machine scheduling
zbMATH Open document ID: 1408.90142
author: Zhiyi Tan
author: Rongqi Li
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6945396
zbMATH Keywords: scheduling
zbMATH Keywords: online
zbMATH Keywords: competitive ratio
zbMATH Keywords: lower bound
MaRDI profile type: Publication
full work available at URL: j.orl.2015.07.002
OpenAlex ID: W889025920
cites work: On randomized online scheduling
cites work: New lower and upper bounds for on-line scheduling
cites work: Q3031924
cites work: On-line scheduling revisited
cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
cites work: Q4952670
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Improved Bounds for the Online Scheduling Problem
DOI: 10.1016/J.ORL.2015.07.002
description: scientific article; zbMATH DE number 6945396