Coupled-Tasks in Presence of Bipartite Compatibilities Graphs
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 parameters of the scheduling problem.
This work has been funded by the regional council of Burgundy.
- 4.Darties, B., Simonin, G., Giroudeau, R., König, J.-C.: Scheduling stretched coupled-tasks with compatibilities constraints: model, complexity and approximation results for some class of graphs. Report, February 2014Google Scholar
- 12.König, J.-C., Simonin, G., Giroudeau, R.: Complexity and approximation for scheduling problem for coupled-tasks in presence of compatibility tasks. In: Project Management and Scheduling (2010)Google Scholar