Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal
type: Item
instance of: scholarly article
title: Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal
zbMATH Open document ID: 1152.68012
author: Devdatta Gangal
author: Abhiram Ranade
published in: Journal of Computer and System Sciences
publication date: 2008-11-19T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5369043
zbMATH Keywords: precedence constrained scheduling
zbMATH Keywords: approximation algorithm
zbMATH Keywords: deadline
MaRDI profile type: Publication
full work available at URL: j.jcss.2008.04.001
OpenAlex ID: W2019712172
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: Scheduling Tasks with Nonuniform Deadlines on Two Processors
cites work: Worst Case Analysis of Two Scheduling Algorithms
cites work: Complexity of Scheduling under Precedence Constraints
DOI: 10.1016/J.JCSS.2008.04.001
description: scientific article; zbMATH DE number 5369043