Coupled task scheduling with exact delays: Literature review and models
The coupled task scheduling problem concerns scheduling a set of jobs, each with at least
two tasks and there is an exact delay period between two consecutive tasks, on a set of …
two tasks and there is an exact delay period between two consecutive tasks, on a set of …
Parameterized complexity of a coupled-task scheduling problem
S Bessy, R Giroudeau - Journal of Scheduling, 2019 - Springer
In this article, we investigate the parameterized complexity of coupled-task scheduling in the
presence of compatibility constraints given by a compatibility graph. In this model, each task …
presence of compatibility constraints given by a compatibility graph. In this model, each task …
[图书][B] The Coupled Task Scheduling Problem: Models and Solution Methods
M Khatami - 2022 - search.proquest.com
The coupled task scheduling problem (CTSP) is studied in this thesis. The problem consists
of scheduling a set of jobs on one or a set of machines, where each job consists of at least …
of scheduling a set of jobs on one or a set of machines, where each job consists of at least …
Scheduling stretched coupled-tasks with compatibilities constraints: model, complexity and approximation results for some class of graphs
We tackle the makespan minimization coupled-tasks problem in presence of compatibility
constraints. In particular, we focus on stretched coupled-tasks,{\it ie} coupled-tasks having …
constraints. In particular, we focus on stretched coupled-tasks,{\it ie} coupled-tasks having …
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints
R Giroudeau, JC König, B Darties… - arXiv preprint arXiv …, 2017 - arxiv.org
This article is devoted to propose some lower and upper bounds for the coupled-tasks
scheduling problem in presence of compatibility constraints according to classical …
scheduling problem in presence of compatibility constraints according to classical …