AbstractWe present in this paper a proof of the NP-completeness of the problem to schedule n simultaneously available jobs on m parallel machines to minimize the weighted sum of machine makespans
In many scheduling applications, a large number of jobs are grouped into a comparatively small numbe...
AbstractWe study the situation where a set of n jobs with release dates and equal processing times h...
AbstractWe discuss the problem of scheduling a set of n independent jobs on m parallel machines to m...
AbstractWe present in this paper a proof of the NP-completeness of the problem to schedule n simulta...
AbstractWe present a dynamic program to solve the problem of scheduling n simultaneously available j...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to min...
Submitted to 13th IFAC Symposium on Information Control Problems in ManufacturingInternational audie...
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...
AbstractThis paper gives the positive answer to the question posed in the title for a wide class of ...
Parallel machine scheduling problem of maximizing the weighted number of just-in-time jobs was inves...
AbstractThe NP-hard problem addressed in this paper is well known in the scheduling literature as R∥...
AbstractIn a recent paper [Discrete Appl. Math. 130 (2003) 449–467], Yang, Ye, and Zhang investigate...
AbstractTo schedule n jobs on m parallel machines with the minimum total cost is the parallel machin...
International audienceThis paper is about scheduling parallel jobs, i.e. which can be executed on mo...
In many scheduling applications, a large number of jobs are grouped into a comparatively small numbe...
AbstractWe study the situation where a set of n jobs with release dates and equal processing times h...
AbstractWe discuss the problem of scheduling a set of n independent jobs on m parallel machines to m...
AbstractWe present in this paper a proof of the NP-completeness of the problem to schedule n simulta...
AbstractWe present a dynamic program to solve the problem of scheduling n simultaneously available j...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to min...
Submitted to 13th IFAC Symposium on Information Control Problems in ManufacturingInternational audie...
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...
AbstractThis paper gives the positive answer to the question posed in the title for a wide class of ...
Parallel machine scheduling problem of maximizing the weighted number of just-in-time jobs was inves...
AbstractThe NP-hard problem addressed in this paper is well known in the scheduling literature as R∥...
AbstractIn a recent paper [Discrete Appl. Math. 130 (2003) 449–467], Yang, Ye, and Zhang investigate...
AbstractTo schedule n jobs on m parallel machines with the minimum total cost is the parallel machin...
International audienceThis paper is about scheduling parallel jobs, i.e. which can be executed on mo...
In many scheduling applications, a large number of jobs are grouped into a comparatively small numbe...
AbstractWe study the situation where a set of n jobs with release dates and equal processing times h...
AbstractWe discuss the problem of scheduling a set of n independent jobs on m parallel machines to m...
DOI
Add to ORKG