Skip to Main content Skip to Navigation
Theses

Random Generation for the Performance Evaluation of Scheduling Algorithms

Abstract : The aim of this thesis is to develop techniques for the evaluation of the performance of algorithms for specific problems of scheduling. The work will consist in proposing experimental protocolsto assess specific problems of scheduling by restricting themselves to those who share similar instances as graphs. This implies on the one hand analyzing the problems considered in order to define what can berelevant instances. Next, it will be necessary to propose generators (random) of (difficult) instances, then perform an experimental analysis of existing algorithms.
Complete list of metadatas

Cited literature [90 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-02500765
Contributor : Abes Star :  Contact
Submitted on : Friday, March 6, 2020 - 12:26:18 PM
Last modification on : Wednesday, September 16, 2020 - 10:42:54 AM
Long-term archiving on: : Sunday, June 7, 2020 - 3:06:19 PM

File

these_A_ELSAYAH_Mohamad_2019.p...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-02500765, version 1

Citation

Mohamad El Sayah. Random Generation for the Performance Evaluation of Scheduling Algorithms. Performance [cs.PF]. Université Bourgogne Franche-Comté, 2019. English. ⟨NNT : 2019UBFCD046⟩. ⟨tel-02500765⟩

Share

Metrics

Record views

144

Files downloads

85