Note on scheduling intervals on-line
type: Item
instance of: scholarly article
title: Note on scheduling intervals on-line
zbMATH Open document ID: 0822.90082
DOI: 10.1016/0166-218X(95)00112-5
author: U. Faigle
author: Willem M. Nawijn
published in: Discrete Applied Mathematics
publication date: 1995-10-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 756162
zbMATH Keywords: interval order
zbMATH Keywords: greedy algorithm
zbMATH Keywords: optimal on-line algorithm
zbMATH Keywords: \(k\)-track assignment
zbMATH Keywords: identical time windows
zbMATH Keywords: coloring
MaRDI profile type: Publication
cites work: The \(k\)-track assignment problem
cites work: Advances in computing and information - ICCI '91. International conference on computing and information, Ottawa, Canada, May 27-29, 1991. Proceedings
cites work: Randomized online algorithms for maximizing busy time interval scheduling
cites work: On chain and antichain families of a partially ordered set
cites work: A linear-time recognition algorithm for interval dags
cites work: Q3128889
cites work: Minimum loss scheduling problems
description: scientific article; zbMATH DE number 756162