AbstractWe present a dynamic program to solve the problem of scheduling n simultaneously available jobs on m parallel machines to minimize the weighted sum machine makespans. This dynamic program is pseudo-polynomial when m is a fixed number
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., f...
International audienceThis paper deals with a common due date parallel machines scheduling problem i...
International audienceThis paper deals with a scheduling problem of independent tasks with common du...
AbstractWe present a dynamic program to solve the problem of scheduling n simultaneously available j...
AbstractWe present in this paper a proof of the NP-completeness of the problem to schedule n simulta...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to min...
AbstractIn this paper we study the n-job two-parallel machines scheduling problem with the objective...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
AbstractIn a recent paper [Discrete Appl. Math. 130 (2003) 449–467], Yang, Ye, and Zhang investigate...
Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some...
In parallel machine scheduling, we are given a set of jobs, together with a number of machines and o...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to mini...
Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some...
We consider the parallel-machine scheduling problem in which the machines have availability constrai...
In many scheduling applications, a large number of jobs are grouped into a comparatively small numbe...
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., f...
International audienceThis paper deals with a common due date parallel machines scheduling problem i...
International audienceThis paper deals with a scheduling problem of independent tasks with common du...
AbstractWe present a dynamic program to solve the problem of scheduling n simultaneously available j...
AbstractWe present in this paper a proof of the NP-completeness of the problem to schedule n simulta...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to min...
AbstractIn this paper we study the n-job two-parallel machines scheduling problem with the objective...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
AbstractIn a recent paper [Discrete Appl. Math. 130 (2003) 449–467], Yang, Ye, and Zhang investigate...
Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some...
In parallel machine scheduling, we are given a set of jobs, together with a number of machines and o...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to mini...
Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some...
We consider the parallel-machine scheduling problem in which the machines have availability constrai...
In many scheduling applications, a large number of jobs are grouped into a comparatively small numbe...
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., f...
International audienceThis paper deals with a common due date parallel machines scheduling problem i...
International audienceThis paper deals with a scheduling problem of independent tasks with common du...
DOI
Add to ORKG