Complexity and approximation for precedence constrained scheduling problems with large communication delays
type: Item
instance of: scholarly article
title: Complexity and approximation for precedence constrained scheduling problems with large communication delays
zbMATH Open document ID: 1143.90012
author: Rodolphe Giroudeau
author: Jean-Claude König
author: Farida Kamila Moulai
author: Jérôme Palaysi
published in: Theoretical Computer Science
publication date: 2008-07-31T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5306534
zbMATH Keywords: scheduling with large communication delays
zbMATH Keywords: non-approximability
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.03.027
OpenAlex ID: W2005955982
cites work: On the complexity of scheduling with large communication delays
cites work: On a routing problem
cites work: Q4247460
cites work: C.P.M. Scheduling with Small Communication Delays and Task Duplication
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3840371
cites work: Three, four, five, six, or the complexity of scheduling with communication delays
cites work: Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems
cites work: An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
cites work: Using duplication for scheduling unitary tasks on m processors with unit communication delays
cites work: A Heuristic for a Scheduling Problem with Communication Delays
cites work: Towards an Architecture-Independent Analysis of Parallel Algorithms
cites work: New complexity results on scheduling with small communication delays
cites work: UET scheduling with unit interprocessor communication delays
cites work: Q4848781
cites work: Q4893453
cites work: Q5286651
DOI: 10.1016/J.TCS.2008.03.027
Recommended article: On the complexity of scheduling with large communication delays
Recommended article: An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
Recommended article: Q4501554
Recommended article: Q4354348
Recommended article: An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
Recommended article: Bicriteria approximation algorithms for scheduling problems with communications delays
Recommended article: New complexity results on scheduling with small communication delays
Recommended article: Scheduling an interval ordered precedence graph with communication delays and a limited number of processors
description: scientific article; zbMATH DE number 5306534