Bicriteria scheduling for contiguous and non contiguous parallel tasks

DOI10.1007/s10479-007-0282-1zbMath1151.90392OpenAlexW2039346141MaRDI QIDQ940878

Evripidis Bampis, Christian Laforest, Fabien Baille, Christophe Rapine

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0282-1

zbMATH Keywords

schedulingparallel tasksbicriteria approximation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

On contiguous and non-contiguous parallel task scheduling

Cites Work

• Unnamed Item
• Scheduling jobs with fixed start and end times
• Note on scheduling intervals on-line
• On the approximability of an interval scheduling problem
• On the \(k\)-coloring of intervals
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• Computing and Combinatorics
• A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Bicriteria scheduling for contiguous and non contiguous parallel tasks