Exponential Algorithms for Scheduling Problems

Abstract : This report focuses on the challenging issue of designing exponential algorithms for scheduling problems. Despite a growing literature dealing with such algorithms for other combinatorial optimization problems, it is still a recent research area in scheduling theory and few results are known. An exponential algorithm solves optimaly an NP-hard optimization problem with a worst-case time, or space, complexity that can be established and, which is lower than the one of a brute-force search. By the way, an exponential algorithm provides information about the complexity in the worst-case of solving a given NP-hard problem. In this report, we provide a survey of the few results known on schduling problems as well as some techniques for deriving exponential algorithms. In a second part we focus on some basic scheduling problems for which we propose exponential algorithms.
Type de document :
Rapport
2014
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00944382
Contributeur : Vincent T'Kindt <>
Soumis le : lundi 10 février 2014 - 15:24:03
Dernière modification le : jeudi 7 février 2019 - 14:21:37
Document(s) archivé(s) le : dimanche 11 mai 2014 - 05:15:55

Fichier

RRExpAlgoScheProb.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00944382, version 1

Citation

Christophe Lenté, Mathieu Liedloff, Ameur Soukhal, Vincent T'Kindt. Exponential Algorithms for Scheduling Problems. 2014. 〈hal-00944382〉

Partager

Métriques

Consultations de la notice

413

Téléchargements de fichiers

543