Trystram Denis

Denis Trystram

Information about the author Denis Trystram will soon be added to the site.
Found 10 papers in total
Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
2016
One of the very important topics in discrete optimization, motivated by practical...
Decentralized list scheduling
Decentralized list scheduling
2013
Classical list scheduling is a very popular and efficient technique for scheduling...
Scheduling with uncertainties on new computing platforms
Scheduling with uncertainties on new computing platforms
2011
New distributed computing platforms (grids) are based on interconnections of a large...
Approximation algorithms for scheduling with reservations
Approximation algorithms for scheduling with reservations
2010
We study the problem of non-preemptively scheduling n independent sequential jobs on a...
Scheduling precedence task graphs with disturbances
Scheduling precedence task graphs with disturbances
2003
In this paper we consider the problem of scheduling precedence task graphs in parallel...
Scheduling malleable tasks on parallel processors to minimize the makespan
Scheduling malleable tasks on parallel processors to minimize the makespan
2004
The problem of optimal scheduling n tasks in a parallel processor system is studied....
Scheduling chains on uniform processors with communication delays
Scheduling chains on uniform processors with communication delays
2002
We show that the problem of scheduling chains of unit execution time (UET) jobs on...
An approximation algorithm for scheduling trees of malleable tasks
An approximation algorithm for scheduling trees of malleable tasks
2002
This work presents an approximation algorithm for scheduling the tasks of a parallel...
Some results on scheduling flat trees in LogP model
Some results on scheduling flat trees in LogP model
1999
This paper deals with the problem of scheduling a flat tree in the Log P model. A flat...
Minimizing the overhead for some tree-scheduling problems
Minimizing the overhead for some tree-scheduling problems
1996
This paper is devoted to the study of tree-scheduling problems within the execution...
Papers per page: