Bicriteria approximation algorithms for scheduling problems with communications delays
type: Item
instance of: scholarly article
title: Bicriteria approximation algorithms for scheduling problems with communications delays
zbMATH Open document ID: 1123.90017
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 5153336
author: Evripidis Bampis
author: Alexander Kononov
MaRDI profile type: Publication
full work available at URL: s10951-005-1637-6
OpenAlex ID: W2089179186
cites work: Q4796176
cites work: Q4252370
cites work: Q4247460
cites work: Q4778556
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
cites work: Three, four, five, six, or the complexity of scheduling with communication delays
cites work: Scheduling jobs with communication delays: Using infeasible solutions for approximation
cites work: A Heuristic for a Scheduling Problem with Communication Delays
cites work: Q4829007
cites work: Q4854377
cites work: On the existence of schedules that are near-optimal for both makespan and total weighted completion time
DOI: 10.1007/S10951-005-1637-6
description: scientific article; zbMATH DE number 5153336