Volume 50, Number 4-5, October-December 2016
Special issue - Advanced Optimization Approaches and Modern OR-Applications
|Page(s)||781 - 795|
|Published online||03 November 2016|
Some complexity and approximation results for coupled-tasks scheduling problem according to topology
1 LE2I, UMR CNRS 6306, University of Burgundy, 8 Rue Alain
Savary, 21000 Dijon, France.
2 LIRMM, UMR CNRS 5506, Université de Montpellier, 161 rue Ada, 34392 Montpellier cedex 5, France.
3 Insight Centre for Data Analytics, University College Cork, Cork, Ireland.
Accepted: 29 April 2016
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.
Mathematics Subject Classification: 90B35 / 68W25 / 68Rxx / 68R10
Key words: Coupled-task scheduling model / complexity / polynomial-time approximation algorithm
© EDP Sciences, ROADEF, SMAI 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.