Coupled-Tasks in Presence of Bipartite Compatibilities Graphs

@inproceedings{Darties2014CoupledTasksIP,
  title={Coupled-Tasks in Presence of Bipartite Compatibilities Graphs},
  author={Beno{\^i}t Darties and Gilles Simonin and Rodolphe Giroudeau and Jean-Claude K{\"o}nig},
  booktitle={ISCO},
  year={2014}
}
We tackle the makespan minimization coupled-tasks problem in presence of incompatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in the framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain, \(\ldots \)). In such context, we design efficient polynomial-time approximation algorithms according to different… 
Approximation algorithm for constrained coupled-tasks scheduling problem
TLDR
This work tackles the makespan minimization coupled-tasks problem in presence of compatibility constraints and proposes some complexity results according to several parameters and designs an efficient polynomial-time approximation algorithm.
Parameterized complexity of a coupled-task scheduling problem
TLDR
It is proved that it is fixed-parameter tractable ($$\mathsf {FPT}$$FPT) parameterized by k the standard parameter if the total duration of each task is bounded by a constant, whereas the problem becomes hard otherwise.

References

SHOWING 1-10 OF 16 REFERENCES
Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs
TLDR
This work tackles the makespan minimization coupled-tasks problem in presence of compatibility constraints and proposes some efficient polynomial-time approximation algorithms according to difference parameters of the scheduling problem.
Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks
TLDR
This paper introduces a coupled-task scheduling problem in the presence of a compatibility graph and additional tasks on a single processor, and develops a polynomial-time algorithm which consists of minimising the number of non-covered vertices by covering vertices with edges or paths of length two in the compatibility graph.
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
TLDR
This paper investigates a particular configuration for coupled tasks, in which the idle time of a coupled task is equal to the sum of durations of its two sub-tasks, and proves the completeness of the minimization of the schedule length.
Complexity and Approximation for Scheduling Problem for Coupled-Tasks in Presence of Compatibility Tasks
TLDR
Complex results and a polynomial-time approximation for a specific problem when the compatibility graph has different topologies are given for a scheduling problem with compled-tasks in presence of incompatible constraint.
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities
The Multiple Subset Sum Problem
TLDR
It is shown that, even for the case of only two bins, no fully PTAS exists for both versions of the MSSP, and a 2/3-approximation algorithm is described that is the best possible approximation ratio.
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
TLDR
This work studies the multiple knapsack problem with assignment restrictions (MKAR) and shows that simple greedy approaches yield 1/3-approximation algorithms for the objective of maximizing assigned weight, and gives an (1/3,2)-approximating algorithm for the bicriteria problem of minimizing utilized capacity.
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
A 3/4-Approximation Algorithm for Multiple Subset Sum
TLDR
A polynomial-time 3/4-approximation algorithm which runs fast also in practice and gets the approximation guarantee for a natural greedy heuristic for the 3-Partitioning Problem.
...
...