Scheduling coupled tasks with exact delays for minimum total job completion time
From MaRDI portal
Publication:2061138
DOI10.1007/s10951-020-00668-1zbMath1479.90081OpenAlexW3087894368MaRDI QIDQ2061138
Publication date: 13 December 2021
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-020-00668-1
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
A note on scheduling coupled tasks for minimum total completion time ⋮ Approximation algorithms for coupled task scheduling minimizing the sum of completion times
Cites Work
- Scheduling coupled-operation jobs with exact time-lags
- A note on scheduling identical coupled tasks in logarithmic time
- Minimizing total completion time in two-machine flow shops with exact delays
- Scheduling for a multifunction phased array radar system
- Modelling for the control of a complex radar system
- An exact algorithm for scheduling identical coupled tasks
- A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar
- Coupled task scheduling with exact delays: literature review and models
- Parameterized complexity of a coupled-task scheduling problem
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
- Scheduling coupled tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Radar pulse interleaving for multi‐target tracking
- New algorithms for coupled tasks scheduling – a survey
- On the complexity of coupled-task scheduling
This page was built for publication: Scheduling coupled tasks with exact delays for minimum total job completion time
