A binary search algorithm for the general coupled task scheduling problem
From MaRDI portal
Publication:6057721
DOI10.1007/s10288-020-00463-wMaRDI QIDQ6057721
Amir Salehipour, Mostafa Khatami
Publication date: 26 October 2023
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10453/144501
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- A branch-and-bound algorithm for the coupled task problem
- Scheduling coupled-operation jobs with exact time-lags
- Identical coupled task scheduling: polynomial complexity of the cyclic case
- Scheduling of coupled tasks and one-machine no-wait robotic cells
- Interleaving two-phased jobs on a single machine
- On linear lower bounds for the resource constrained project scheduling problem.
- Coupled task scheduling with exact delays: literature review and models
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- Approximation algorithms for UET scheduling problems with exact delays
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- Scheduling coupled tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The m-Traveling Salesman Problem with Minmax Objective
- On the complexity of coupled-task scheduling