Approximating coupled-task scheduling problems with equal exact delays

DOI10.1007/978-3-319-44914-2_21MaRDI QIDQ3133220zbMATH OpenOpenAlexFDO

Authors

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 algorithmcouple-task schedulinginapproximability lower boundworst-case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• An improved approximation algorithm for the coupled-task scheduling problem with equal exact delays
• Approximation Algorithms for Scheduling Problems with Exact Delays
• Approximation algorithms for coupled task scheduling minimizing the sum of completion times
• A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays
• An exact algorithm for scheduling identical coupled tasks

Cited in

(13)

• An exact algorithm for scheduling identical coupled tasks
• A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays
• Scheduling coupled tasks with exact delays for minimum total job completion time
• Coupled task scheduling with exact delays: literature review and models
• Parameterized complexity of a coupled-task scheduling problem
• Approximation algorithms for UET scheduling problems with exact delays
• An improved approximation algorithm for the coupled-task scheduling problem with equal exact delays
• Some complexity and approximation results for coupled-tasks scheduling problem according to topology
• Approximation Algorithms for Scheduling Problems with Exact Delays
• Approximation algorithms for coupled task scheduling minimizing the sum of completion times
• Scheduling coupled tasks on parallel identical machines
• Scheduling coupled-operation jobs with exact time-lags
• A coupled task scheduling approximation algorithm for minimizing the sum of completion times

This page was built for publication: Approximating coupled-task scheduling problems with equal exact delays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133220)