Bicriteria approximation algorithms for scheduling problems with communications delays

DOI10.1007/S10951-005-1637-6zbMath1123.90017OpenAlexW2089179186MaRDI QIDQ880503

Alexander V. Kononov, Evripidis Bampis

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-1637-6

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Approximation algorithms for coupled task scheduling minimizing the sum of completion times ⋮ Approximation algorithms for the bi-criteria weighted MAX-CUT problem ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time ⋮ A new approach for bicriteria partitioning problem

Cites Work

• Three, four, five, six, or the complexity of scheduling with communication delays
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Heuristic for a Scheduling Problem with Communication Delays
• Scheduling jobs with communication delays: Using infeasible solutions for approximation
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bicriteria approximation algorithms for scheduling problems with communications delays