Approximating Coupled-Task Scheduling Problems with Equal Exact Delays

DOI10.1007/978-3-319-44914-2_21zbMath1385.90006OpenAlexW2557915111MaRDI QIDQ3133220

No author found.

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_21

zbMATH Keywords

approximation algorithmworst-case analysisinapproximability lower boundcouple-task scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Approximation algorithms for coupled task scheduling minimizing the sum of completion times ⋮ Coupled task scheduling with exact delays: literature review and models ⋮ Parameterized complexity of a coupled-task scheduling problem ⋮ A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays

This page was built for publication: Approximating Coupled-Task Scheduling Problems with Equal Exact Delays