New lower and upper bounds for on-line scheduling
type: Item
instance of: scholarly article
title: New lower and upper bounds for on-line scheduling
zbMATH Open document ID: 0823.90059
DOI: 10.1016/0167-6377(94)90071-X
author: Bo Chen
author: André van Vliet
author: Gerhard J. Woeginger
published in: Operations Research Letters
publication date: 1995-07-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 761912
zbMATH Keywords: worst-case analysis
zbMATH Keywords: on-line scheduling a set of independent jobs
zbMATH Keywords: parallel and identical machines
MaRDI profile type: Publication
cites work: Q3031924
cites work: Q4198056
cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
cites work: Bounds for Certain Multiprocessing Anomalies
full work available at URL: 0167-6377(94)90071-x
OpenAlex ID: W1996869102
description: scientific article; zbMATH DE number 761912