A branch-and-bound algorithm for the coupled task problem
From MaRDI portal
Recommendations
- A branch-and-bound algorithm for the singly constrained assignment problem
- A binary search algorithm for the general coupled task scheduling problem
- Branch and bound algorithms for the multidimensional assignment problem
- Parameterized complexity of a coupled-task scheduling problem
- A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM
- On the complexity of coupled-task scheduling
- A branch and bound algorithm for the job-shop scheduling problem
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times
- scientific article; zbMATH DE number 2087412
- A branch-and-bound algorithm for one class of scheduling problem
Cites work
- An exact algorithm for scheduling identical coupled tasks
- Approximation algorithms for UET scheduling problems with exact delays
- Heuristics for a coupled-operation scheduling problem
- Interleaving two-phased jobs on a single machine
- On the complexity of coupled-task scheduling
- Radar pulse interleaving for multi‐target tracking
- Scheduling for a multifunction phased array radar system
Cited in
(5)- Improved analysis of an algorithm for the coupled task problem with UET jobs
- Coupled task scheduling with time-dependent processing times
- Coupled task scheduling with exact delays: literature review and models
- A binary search algorithm for the general coupled task scheduling problem
- The coupled task scheduling problem: an improved mathematical program and a new solution algorithm
This page was built for publication: A branch-and-bound algorithm for the coupled task problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406642)