Semi-on-line scheduling on two parallel processors with an upper bound on the items
type: Item
instance of: scholarly article
title: Semi-on-line scheduling on two parallel processors with an upper bound on the items
zbMATH Open document ID: 1082.90034
author: Enrico Angelelli
author: Zsolt Tuza
author: Maria Grazia Speranza
published in: Algorithmica
publication date: 2005-02-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 2133716
zbMATH Keywords: Scheduling
zbMATH Keywords: Two parallel processors
zbMATH Keywords: Semi-on-line
zbMATH Keywords: Competitive analysis
MaRDI profile type: Publication
full work available at URL: s00453-003-1037-2
OpenAlex ID: W2089938457
cites work: Better Bounds for Online Scheduling
DOI: 10.1007/S00453-003-1037-2
description: scientific article; zbMATH DE number 2133716