AbstractWe consider a scheduling problem where the processing time of any job is dependent on the usage of a discrete renewable resource, e.g. personnel. An amount of k units of that resource can be allocated to the jobs at any time, and the more of that resource is allocated to a job, the smaller its processing time. The objective is to find a resource allocation and a schedule that minimizes the makespan. We explicitly allow for succinctly encodable time-resource tradeoff functions, which calls for mathematical programming techniques other than those that have been used before. Utilizing a (nonlinear) integer mathematical program, we obtain the first polynomial time approximation algorithm for the scheduling problem, with performance boun...
International audienceWe consider a natural generalization of classical scheduling problems in which...
In this paper we study a parallel machine scheduling problem with non-renewable resource constraints...
Project planning and scheduling when there are both resource constraints and uncertainty in task du...
AbstractWe consider a scheduling problem where the processing time of any job is dependent on the us...
We consider a scheduling problem where the processing time of any job is dependent on the usage of a...
We consider a scheduling problem where the processing time of any job is dependent on the usage of a...
We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines....
The paper presents new approximability results for single machine scheduling problems with jobs requ...
AbstractWe study a resource allocation problem where jobs have the following characteristic: each jo...
We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines....
We consider machine scheduling on unrelated parallel machines with the objective to minimize the sch...
We consider machine scheduling on unrelated parallel machines with the objective to minimize the sch...
AbstractWe consider a scheduling problem with a single machine and a set of jobs which have to be pr...
We consider single machine scheduling problems with additional non-renewable resource constraints. E...
The paper presents new approximability results for single machine scheduling problems with jobs requ...
International audienceWe consider a natural generalization of classical scheduling problems in which...
In this paper we study a parallel machine scheduling problem with non-renewable resource constraints...
Project planning and scheduling when there are both resource constraints and uncertainty in task du...
AbstractWe consider a scheduling problem where the processing time of any job is dependent on the us...
We consider a scheduling problem where the processing time of any job is dependent on the usage of a...
We consider a scheduling problem where the processing time of any job is dependent on the usage of a...
We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines....
The paper presents new approximability results for single machine scheduling problems with jobs requ...
AbstractWe study a resource allocation problem where jobs have the following characteristic: each jo...
We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines....
We consider machine scheduling on unrelated parallel machines with the objective to minimize the sch...
We consider machine scheduling on unrelated parallel machines with the objective to minimize the sch...
AbstractWe consider a scheduling problem with a single machine and a set of jobs which have to be pr...
We consider single machine scheduling problems with additional non-renewable resource constraints. E...
The paper presents new approximability results for single machine scheduling problems with jobs requ...
International audienceWe consider a natural generalization of classical scheduling problems in which...
In this paper we study a parallel machine scheduling problem with non-renewable resource constraints...
Project planning and scheduling when there are both resource constraints and uncertainty in task du...