Parallel machine scheduling entails assigning jobs to identical machines, k ∈ {1,...,m}, and deciding on their start time. Each job j ∈ {1,..., n} requires a given processing time pj. Its starting time is denoted by Sj (its completion time is then Cj = Sj + pj). The objective is typically some regular function of the completion times. Here
The main problem studied in this thesis is that of parallel machine scheduling with precedence const...
A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular ...
We investigate one-machine scheduling problems subject to generalized prece-dence constraints. A pre...
This paper considers a deterministic scheduling problem where multiple jobs with s-precedence relati...
For s-precedence constraints, job i cannot start processing until all jobs that precede i start. Thi...
This paper considers a problem of scheduling s-precedence constrained jobs on machines in parallel w...
For s-precedence constraints, a job cannot start processing until all preceding jobs have started. W...
Dans cette thèse, nous considérons une famille des problèmes d’ordonnancement avec machine parallèle...
Single machine scheduling with precedence relations are well studied. In this paper, we extend the s...
We consider various single machine scheduling problems in which the processing time of a job depends...
Parallel programs are usually modeled by task graphs which are directed acyclic graphs. Their vertic...
International audienceIn this paper, we consider two dedicated parallel machines scheduling problem ...
We consider the single machine parallel batch scheduling problems to minimize makespan and total com...
Consider a set of n jobs to be processed on a set of μ unrelated parallel machines subject to preced...
International audienceThis paper presents different methods for solving parallel machine scheduling ...
The main problem studied in this thesis is that of parallel machine scheduling with precedence const...
A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular ...
We investigate one-machine scheduling problems subject to generalized prece-dence constraints. A pre...
This paper considers a deterministic scheduling problem where multiple jobs with s-precedence relati...
For s-precedence constraints, job i cannot start processing until all jobs that precede i start. Thi...
This paper considers a problem of scheduling s-precedence constrained jobs on machines in parallel w...
For s-precedence constraints, a job cannot start processing until all preceding jobs have started. W...
Dans cette thèse, nous considérons une famille des problèmes d’ordonnancement avec machine parallèle...
Single machine scheduling with precedence relations are well studied. In this paper, we extend the s...
We consider various single machine scheduling problems in which the processing time of a job depends...
Parallel programs are usually modeled by task graphs which are directed acyclic graphs. Their vertic...
International audienceIn this paper, we consider two dedicated parallel machines scheduling problem ...
We consider the single machine parallel batch scheduling problems to minimize makespan and total com...
Consider a set of n jobs to be processed on a set of μ unrelated parallel machines subject to preced...
International audienceThis paper presents different methods for solving parallel machine scheduling ...
The main problem studied in this thesis is that of parallel machine scheduling with precedence const...
A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular ...
We investigate one-machine scheduling problems subject to generalized prece-dence constraints. A pre...