Randomized online interval scheduling
type: Item
instance of: scholarly article
title: Randomized online interval scheduling
zbMATH Open document ID: 0914.90168
DOI: 10.1016/S0167-6377(98)00019-4
author: Steven S. Seiden
published in: Operations Research Letters
publication date: 1999-06-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1229535
zbMATH Keywords: online interval scheduling
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: optimal 4-competitive deterministic algorithm
MaRDI profile type: Publication
cites work: On the competitiveness of on-line real-time task scheduling
cites work: On the power of randomization in on-line algorithms
cites work: Q4234110
cites work: Note on scheduling intervals on-line
cites work: Q4320535
cites work: Competitive snoopy caching
cites work: Q3128889
cites work: Randomized competitive algorithms for the list update problem
cites work: On-line scheduling of jobs with fixed start and end times
full work available at URL: s0167-6377(98)00019-4
OpenAlex ID: W2028234874
description: scientific article; zbMATH DE number 1229535