SOME COMPLEXITY AND APPROXIMATION RESULTS FOR COUPLED-TASKS SCHEDULING PROBLEM ACCORDING TO TOPOLOGY

Affiliation auteurs!!!! Error affiliation !!!!
TitreSOME COMPLEXITY AND APPROXIMATION RESULTS FOR COUPLED-TASKS SCHEDULING PROBLEM ACCORDING TO TOPOLOGY
Type de publicationJournal Article
Year of Publication2016
AuteursDarties B, Giroudeau R, Konig J-C, Simonin G
JournalRAIRO-OPERATIONS RESEARCH
Volume50
Pagination781-795
Date PublishedOCT-DEC
Type of ArticleArticle; Proceedings Paper
ISSN0399-0559
Mots-cléscomplexity, Coupled-task scheduling model, polynomial-time approximation algorithm
Résumé

We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. 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 framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain, ...). In such a context, we design some efficient polynomial-time approximation algorithms for an intractable scheduling problem according to some parameters.
DOI10.1051/ro/2016034