We consider the parallel approximability of two problems arising from high multiplicity scheduling, namely the unweighted model with variable processing requirements and the weighted model with identical processing requirements. These two problems are known to be modelled by a class of quadratic programs that are efficiently solvable in polynomial time. On the parallel setting, both problems are
Scheduling is a crucial problem in parallel and distributed processing. It consists of determining w...
International audienceIn this paper, we study the problem of scheduling on $k$ identical machines a ...
We consider the total weighted completion time minimization for the two-parallel capacitated machine...
We consider the parallel approximability of two problems arising from high multiplicity scheduling, ...
In many scheduling applications, a large number of jobs are grouped into a comparatively small numbe...
AbstractIn a recent paper Hochbaum developed a polynomial algorithm for solving a scheduling problem...
High multiplicity scheduling problems arise naturally in contemporary production settings where manu...
We consider the solution of some NP-hard parallel machine scheduling problems involving the minimiza...
We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines....
We consider the following scheduling problem. There arem parallel machines andn independent jobs. Ea...
In this paper we analyze the parallel approximability of two special classes of Quadratic Programmin...
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigne...
International audienceWe study the problem of scheduling on $k$ identical machines a set of parallel...
This thesis addresses the scheduling problems on parallel machines, with and without nonavailability...
Scheduling is a crucial problem in parallel and distributed processing. It consists of determining w...
International audienceIn this paper, we study the problem of scheduling on $k$ identical machines a ...
We consider the total weighted completion time minimization for the two-parallel capacitated machine...
We consider the parallel approximability of two problems arising from high multiplicity scheduling, ...
In many scheduling applications, a large number of jobs are grouped into a comparatively small numbe...
AbstractIn a recent paper Hochbaum developed a polynomial algorithm for solving a scheduling problem...
High multiplicity scheduling problems arise naturally in contemporary production settings where manu...
We consider the solution of some NP-hard parallel machine scheduling problems involving the minimiza...
We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines....
We consider the following scheduling problem. There arem parallel machines andn independent jobs. Ea...
In this paper we analyze the parallel approximability of two special classes of Quadratic Programmin...
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigne...
International audienceWe study the problem of scheduling on $k$ identical machines a set of parallel...
This thesis addresses the scheduling problems on parallel machines, with and without nonavailability...
Scheduling is a crucial problem in parallel and distributed processing. It consists of determining w...
International audienceIn this paper, we study the problem of scheduling on $k$ identical machines a ...
We consider the total weighted completion time minimization for the two-parallel capacitated machine...
DOI
Add to ORKG