Add to ORKGIn this talk we survey the area of scheduling with the objective to maximize the throughput, i.e., the (weighted) number of com-pleted jobs. We focus on several open problems
We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applic...
AbstractThis paper considers an online scheduling problem arising from Quality-of-Service (QoS) appl...
This dissertation addresses the problem of scheduling a set of jobs under two different measures of ...
International audienceWe are given a set of n jobs and a single processor that can vary its speed dy...
International audienceWe are given a set of n jobs and a single processor that can vary its speed dy...
One of the basic scheduling problems, the open-shop scheduling problem has a broad range of applicat...
International audienceThis paper is about scheduling parallel jobs, i.e. which can be executed on mo...
We consider the problem of off-line throughput maximization for job scheduling on one or more machin...
Multi objective scheduling has been playing a vital role in literature from past decades now. Single...
We study an online scheduling problem for unit-length jobs, where each job is specified by its relea...
This paper discusses review of literature of open shop scheduling problems. First, the problem is cl...
Rapport interne.Problems of scheduling $n$ jobs on a single machine to maximize regular objective fu...
gained one author and lost one degree in the complexityWe study the problem of computing a preemptiv...
International audienceWe study the following energy-efficient scheduling problem. We are given a set...
Submitted to 13th IFAC Symposium on Information Control Problems in ManufacturingThis paper is about...
We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applic...
AbstractThis paper considers an online scheduling problem arising from Quality-of-Service (QoS) appl...
This dissertation addresses the problem of scheduling a set of jobs under two different measures of ...
International audienceWe are given a set of n jobs and a single processor that can vary its speed dy...
International audienceWe are given a set of n jobs and a single processor that can vary its speed dy...
One of the basic scheduling problems, the open-shop scheduling problem has a broad range of applicat...
International audienceThis paper is about scheduling parallel jobs, i.e. which can be executed on mo...
We consider the problem of off-line throughput maximization for job scheduling on one or more machin...
Multi objective scheduling has been playing a vital role in literature from past decades now. Single...
We study an online scheduling problem for unit-length jobs, where each job is specified by its relea...
This paper discusses review of literature of open shop scheduling problems. First, the problem is cl...
Rapport interne.Problems of scheduling $n$ jobs on a single machine to maximize regular objective fu...
gained one author and lost one degree in the complexityWe study the problem of computing a preemptiv...
International audienceWe study the following energy-efficient scheduling problem. We are given a set...
Submitted to 13th IFAC Symposium on Information Control Problems in ManufacturingThis paper is about...
We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applic...
AbstractThis paper considers an online scheduling problem arising from Quality-of-Service (QoS) appl...
This dissertation addresses the problem of scheduling a set of jobs under two different measures of ...