• Corpus ID: 117940131

Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs

@inproceedings{Darties2014SchedulingSC,
  title={Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs},
  author={Beno{\^i}t Darties and Rodolphe Giroudeau and Jean-Claude K{\"o}nig and Gilles Simonin},
  year={2014}
}
We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, {\it i.e.}coupled-tasks having the same sub-tasks execution time and idle time duration. We study severals problems in frame works of classic complexity and approximation for which the compatibility graph $G_c$ is bipartite (star, chain, $\ldots$) In such context, we design some efficient polynomial-time approximation algorithms according to… 
hal.archives-ouvertes.fr
2 Citations
Background Citations
1
Methods Citations
1

Figures and Tables from this paper

2 Citations

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs
TLDR
This work tackles the makespan minimization coupled-tasks problem in presence of incompatibility constraints and designs efficient polynomial-time approximation algorithms according to different parameters of the scheduling problem.
Scheduling coupled-tasks with incompatibility constraint: a bin-packing related problem
We tackle the makespan minimization problem of coupled- tasks in presence of compatibility constraint. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks…

References

SHOWING 1-10 OF 15 REFERENCES
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.
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph
TLDR
A generalization of the coupled-task sche-duling problem introduced by Shapiro, where considered tasks are subject to incompatibility constraints depicted by an undirected graph is presented, and a new polynomial-time approximation algorithm result is given which completes previous works.
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.
Complexity and approximation for precedence constrained scheduling problems with large communication delays
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 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.
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.
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.
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
TLDR
An algorithm is presented which finds for any 0 < e < 1 an approximate solution P satisfying (P* P)/P* < ~, where P* is the desired optimal sum.
...
...