A note on scheduling identical coupled tasks in logarithmic time

DOI10.1016/J.DAM.2009.10.012MaRDI QIDQ968178zbMATH OpenOpenAlexFDO

Authors Philippe Baptiste

Publication date 5 May 2010

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2009.10.012

zbMATH Keywords

radarschedulingcoupled tasks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An exact algorithm for scheduling identical coupled tasks
• Scheduling of coupled tasks with unit processing times
• Identical coupled task scheduling: polynomial complexity of the cyclic case
• New algorithms for coupled tasks scheduling - a survey
• Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks

Cites work

• An exact algorithm for scheduling identical coupled tasks
• Integer Programming with a Fixed Number of Variables
• On scheduling a multifunction radar
• On the complexity of coupled-task scheduling
• Radar pulse interleaving for multi‐target tracking
• Scheduling coupled tasks
• Scheduling for a multifunction phased array radar system

Cited in

(15)

• scientific article; zbMATH DE number 1863264 (Why is no real title available?)
• New characterizations for the identical coupled tasks scheduling problem
• Scheduling coupled-operation jobs with exact time-lags
• Scheduling of coupled tasks with unit processing times
• An exact algorithm for scheduling identical coupled tasks
• A note on scheduling coupled tasks for minimum total completion time
• Coupled task scheduling with time-dependent processing times
• Scheduling coupled tasks with exact delays for minimum total job completion time
• The coupled unit-time operations problem on identical parallel machines with respect to the makespan
• Coupled task scheduling with exact delays: literature review and models
• Identical coupled task scheduling: polynomial complexity of the cyclic case
• New algorithms for coupled tasks scheduling - a survey
• Scheduling coupled tasks on parallel identical machines
• Scheduling periodic messages on a shared link without buffering
• Complexity of scheduling of coupled tasks with chains precedence constraints and constant even length of the gap

This page was built for publication: A note on scheduling identical coupled tasks in logarithmic time

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