Scheduling loosely connected task graphs.
type: Item
instance of: scholarly article
title: Scheduling loosely connected task graphs.
zbMATH Open document ID: 1054.68021
DOI: 10.1016/S0022-0000(03)00071-0
author: Abhiram Ranade
published in: Journal of Computer and System Sciences
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1967164
zbMATH Keywords: Precedence-constrained scheduling
zbMATH Keywords: Approximation algorithm
MaRDI profile type: Publication
cites work: A New Insight into the Coffman–Graham Algorithm
cites work: Optimal scheduling for two-processor systems
cites work: Optimal Sequencing of Two Equivalent Processors
cites work: Worst Case Analysis of Two Scheduling Algorithms
cites work: Complexity of Scheduling under Precedence Constraints
full work available at URL: s0022-0000(03)00071-0
OpenAlex ID: W2088332251
description: scientific article; zbMATH DE number 1967164