A note on scheduling identical coupled tasks in logarithmic time
From MaRDI portal
Publication:968178
DOI10.1016/J.DAM.2009.10.012zbMATH Open1196.90046OpenAlexW2091574768MaRDI QIDQ968178FDOQ968178
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
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Integer Programming with a Fixed Number of Variables
- Scheduling for a multifunction phased array radar system
- An exact algorithm for scheduling identical coupled tasks
- Radar pulse interleaving for multi‐target tracking
- On the complexity of coupled-task scheduling
- Scheduling coupled tasks
- On scheduling a multifunction radar
Cited In (12)
- New characterizations for the identical coupled tasks scheduling problem
- Title not available (Why is that?)
- Scheduling coupled-operation jobs with exact time-lags
- 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
- Scheduling coupled tasks on parallel identical machines
- Scheduling periodic messages on a shared link without buffering
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)
