A binary search algorithm for the general coupled task scheduling problem
From MaRDI portal
Recommendations
- A branch-and-bound algorithm for the coupled task problem
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times
- Coupled task scheduling with exact delays: literature review and models
- An exact algorithm for scheduling identical coupled tasks
- New algorithms for coupled tasks scheduling - a survey
Cites work
- A branch-and-bound algorithm for the coupled task problem
- Approximation algorithms for UET scheduling problems with exact delays
- Coupled task scheduling with exact delays: literature review and models
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Identical coupled task scheduling: polynomial complexity of the cyclic case
- Interleaving two-phased jobs on a single machine
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- On linear lower bounds for the resource constrained project scheduling problem.
- On the complexity of coupled-task scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling coupled tasks
- Scheduling coupled-operation jobs with exact time-lags
- Scheduling of coupled tasks and one-machine no-wait robotic cells
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- The m-Traveling Salesman Problem with Minmax Objective
Cited in
(4)- A branch-and-bound algorithm for the coupled task problem
- The coupled task scheduling problem: an improved mathematical program and a new solution algorithm
- Scheduling coupled tasks on parallel identical machines
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
This page was built for publication: A binary search algorithm for the general coupled task scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057721)