Scheduling real-time computations with separation constraints
type: Item
instance of: scholarly article
title: Scheduling real-time computations with separation constraints
zbMATH Open document ID: 0768.68005
DOI: 10.1016/0020-0190(92)90091-9
author: Ching-Chih Han
author: Kwei-Jay Lin
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68M99
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 92094
zbMATH Keywords: scheduling
zbMATH Keywords: real-time systems
zbMATH Keywords: separation problem
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: directed forest
zbMATH Keywords: trees
zbMATH Keywords: forest
zbMATH Keywords: minimum distance constraints
MaRDI profile type: Publication
full work available at URL: 0020-0190(92)90091-9
OpenAlex ID: W2000197176
cites work: Q4198056
cites work: On Some Variants of the Bandwidth Minimization Problem
cites work: The NP-completeness of the bandwidth minimization problem
description: scientific article; zbMATH DE number 92094