Author name used in this publication: T. C. E. Cheng2008-2009 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
AbstractThe NP-hard problem addressed in this paper is well known in the scheduling literature as R∥...
International audienceThis paper considers the scheduling of job families on parallel machines with ...
The problem of scheduling n independent jobs on m uniform parallel machines such that the total comp...
We consider the m parallel-machine scheduling problem that process service requests from various cus...
Author name used in this publication: T. C. E. Cheng2006-2007 > Academic research: refereed > Public...
2009-2010 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
We derive two fully polynomial time approximation schemes for parallel-machine scheduling on a fixed...
AbstractIn a recent paper [Discrete Appl. Math. 130 (2003) 449–467], Yang, Ye, and Zhang investigate...
A fully polynomial time approximation scheme (FPTAS) with run time 0(nm/ εm-1) is developed for a pr...
Abstract: In this paper, we consider a parallel machine problem where machines and jobs can be class...
AbstractWe consider parallel-machine scheduling problems in which the processing time of a job is a ...
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., f...
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
International audienceWe consider a multiobjective scheduling problem, with the aim of minimizing th...
In this paper we study variants of the non-preemptive parallel job scheduling problem in which the n...
AbstractThe NP-hard problem addressed in this paper is well known in the scheduling literature as R∥...
International audienceThis paper considers the scheduling of job families on parallel machines with ...
The problem of scheduling n independent jobs on m uniform parallel machines such that the total comp...
We consider the m parallel-machine scheduling problem that process service requests from various cus...
Author name used in this publication: T. C. E. Cheng2006-2007 > Academic research: refereed > Public...
2009-2010 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
We derive two fully polynomial time approximation schemes for parallel-machine scheduling on a fixed...
AbstractIn a recent paper [Discrete Appl. Math. 130 (2003) 449–467], Yang, Ye, and Zhang investigate...
A fully polynomial time approximation scheme (FPTAS) with run time 0(nm/ εm-1) is developed for a pr...
Abstract: In this paper, we consider a parallel machine problem where machines and jobs can be class...
AbstractWe consider parallel-machine scheduling problems in which the processing time of a job is a ...
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., f...
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
International audienceWe consider a multiobjective scheduling problem, with the aim of minimizing th...
In this paper we study variants of the non-preemptive parallel job scheduling problem in which the n...
AbstractThe NP-hard problem addressed in this paper is well known in the scheduling literature as R∥...
International audienceThis paper considers the scheduling of job families on parallel machines with ...
The problem of scheduling n independent jobs on m uniform parallel machines such that the total comp...
DOI
Add to ORKG