This paper examines a single-machine, non-renewable-resource-constrained scheduling problem where jobs have arbitary processing times and resource requirements. Unit supply of a resource is assumed at each time period. Performance criterion is makespan. It is proved that this problem is identical to the two-machine flowshop problem, enabling the use of Johnson's algorithm. Immediate extensions of this result are presented
International audienceThis paper addresses the problem of open shop scheduling on two machines with ...
We consider a generalization of the classical resource constrained project scheduling problem. We in...
We consider a scheduling problem where the processing time of any job is dependent on the usage of a...
International audienceMost of traditional scheduling problems deal with machine as the only resource...
The paper presents new approximability results for single machine scheduling problems with jobs requ...
In this paper we discuss exact and approxi- mation algorithms for scheduling a single machine with ...
AbstractThe problem of scheduling a set of unit-time jobs on m uniform machines is studied. Some job...
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...
The paper presents new approximability results for single machine scheduling problems with jobs requ...
In this paper the approximability of parallel machine scheduling problems with resource consuming jo...
International audienceThe paper deals with a single machine scheduling problem with job processing t...
We consider a scheduling problem where the processing time of any job is dependent on the usage of a...
In this paper the approximability of parallel machine scheduling problems with resource consuming j...
We consider a single machine scheduling problem in which the processing time of a job is a simple li...
International audienceThis paper addresses the problem of open shop scheduling on two machines with ...
We consider a generalization of the classical resource constrained project scheduling problem. We in...
We consider a scheduling problem where the processing time of any job is dependent on the usage of a...
International audienceMost of traditional scheduling problems deal with machine as the only resource...
The paper presents new approximability results for single machine scheduling problems with jobs requ...
In this paper we discuss exact and approxi- mation algorithms for scheduling a single machine with ...
AbstractThe problem of scheduling a set of unit-time jobs on m uniform machines is studied. Some job...
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...
The paper presents new approximability results for single machine scheduling problems with jobs requ...
In this paper the approximability of parallel machine scheduling problems with resource consuming jo...
International audienceThe paper deals with a single machine scheduling problem with job processing t...
We consider a scheduling problem where the processing time of any job is dependent on the usage of a...
In this paper the approximability of parallel machine scheduling problems with resource consuming j...
We consider a single machine scheduling problem in which the processing time of a job is a simple li...
International audienceThis paper addresses the problem of open shop scheduling on two machines with ...
We consider a generalization of the classical resource constrained project scheduling problem. We in...
We consider a scheduling problem where the processing time of any job is dependent on the usage of a...