A note on scheduling identical coupled tasks in logarithmic time
From MaRDI portal
Publication:968178
DOI10.1016/j.dam.2009.10.012zbMath1196.90046OpenAlexW2091574768MaRDI QIDQ968178
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)
Related Items (6)
The coupled unit-time operations problem on identical parallel machines with respect to the makespan ⋮ Identical coupled task scheduling: polynomial complexity of the cyclic case ⋮ Scheduling coupled-operation jobs with exact time-lags ⋮ Coupled task scheduling with exact delays: literature review and models ⋮ Scheduling coupled tasks with exact delays for minimum total job completion time ⋮ Coupled task scheduling with time-dependent processing times
Cites Work
- Scheduling for a multifunction phased array radar system
- An exact algorithm for scheduling identical coupled tasks
- Integer Programming with a Fixed Number of Variables
- On scheduling a multifunction radar
- Scheduling coupled tasks
- Radar pulse interleaving for multi‐target tracking
- On the complexity of coupled-task scheduling
This page was built for publication: A note on scheduling identical coupled tasks in logarithmic time
