Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors
type: Item
instance of: scholarly article
title: Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors
zbMATH Open document ID: 1237.90141
author: Abir Benabid
author: Claire Hanen
published in: Electronic Notes in Discrete Mathematics
publication date: 2012-05-13T00:00:00Z
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6033998
zbMATH Keywords: scheduling theory
zbMATH Keywords: dedicated processors
zbMATH Keywords: unit execution times
zbMATH Keywords: precedence delays
zbMATH Keywords: maximum lateness
zbMATH Keywords: worst-case analysis
MaRDI profile type: Publication
full work available at URL: j.endm.2010.05.100
OpenAlex ID: W1983452345
cites work: A New Insight into the Coffman–Graham Algorithm
cites work: Q2734595
cites work: Performance of Garey-Johnson algorithm for pipelined typed tasks systems
cites work: Complexity of Scheduling under Precedence Constraints
cites work: NP-complete scheduling problems
cites work: An iterative algorithm for scheduling UET tasks with due dates and release times.
cites work: An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
DOI: 10.1016/J.ENDM.2010.05.100
description: scientific article; zbMATH DE number 6033998