On the complexity of coupled-task scheduling
From MaRDI portal
Recommendations
- A note on scheduling coupled tasks for minimum total completion time
- Two-machine flowshop scheduling problem with coupled-operations
- Scheduling of coupled tasks with unit processing times
- Identical coupled task scheduling: polynomial complexity of the cyclic case
- Coupled task scheduling with exact delays: literature review and models
Cites work
Cited in
(37)- Improved analysis of an algorithm for the coupled task problem with UET jobs
- Scheduling for a multifunction phased array radar system
- Modelling for the control of a complex radar system
- Minimizing flowtime for paired tasks
- 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 time-dependent processing times
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- Coupled task scheduling with exact delays: literature review and models
- Parameterized complexity of a coupled-task scheduling problem
- Two-machine flowshop scheduling problem with coupled-operations
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- Approximation algorithms for UET scheduling problems with exact delays
- Coupled task scheduling with convex resource consumption functions
- A note on scheduling coupled tasks for minimum total completion time
- Two machines flow shop with reentrance and exact time lag
- Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
- A branch-and-bound algorithm for the coupled task problem
- Scheduling of coupled tasks with unit processing times
- A binary search algorithm for the general coupled task scheduling problem
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times
- The coupled task scheduling problem: an improved mathematical program and a new solution algorithm
- Scheduling coupled tasks on parallel identical machines
- On minimizing total earliness and tardiness of coupled-tasks - a complexity result
- Single-machine scheduling with coupled task and rejection
- New efficient algorithms for the two-machine no-wait chain-reentrant shop problem
- Scheduling periodic messages on a shared link without buffering
- Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete
- Parameterized complexity of a parallel machine scheduling problem
- Scheduling coupled-operation jobs with exact time-lags
- A coupled task scheduling approximation algorithm for minimizing the sum of completion times
- Identical coupled task scheduling: polynomial complexity of the cyclic case
- Scheduling of coupled tasks and one-machine no-wait robotic cells
- A note on scheduling identical coupled tasks in logarithmic time
This page was built for publication: On the complexity of coupled-task scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961610)
