6533b856fe1ef96bd12b1eb8
RESEARCH PRODUCT
Some complexity and approximation results for coupled-tasks scheduling problem according to topology
Gilles SimoninRodolphe GiroudeauBenoit DartiesJean-claude Königsubject
FOS: Computer and information sciencesCoupled-task scheduling model[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Computer science0211 other engineering and technologies0102 computer and information sciences02 engineering and technologyManagement Science and Operations ResearchComputational Complexity (cs.CC)Topology01 natural sciencesExecution timeTheoretical Computer ScienceComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)021103 operations researchJob shop schedulingPolynomial-time approximation algorithmApproximation algorithmCompatibility graphComplexityIdle timeComputer Science ApplicationsComputer Science - Computational Complexity[ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]010201 computation theory & mathematicsCompatibility (mechanics)Bipartite graphMinificationdescription
International audience; 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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2016-01-01 |