2005-2006 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
AbstractIn the literature, most of the parallel-machine scheduling problems, in which the processing...
We consider the NP-hard problem of scheduling parallel jobs with release dates on identical parallel...
AbstractThis paper deals with single-machine scheduling problems with decreasing linear deterioratio...
We consider the scheduling problem of minimizing the makespan on a single machine with step-improvin...
Author name used in this publication: T. C. E. Cheng2006-2007 > Academic research: refereed > Public...
Production systems often experience a shock or a technological change, resulting in performance impr...
[[abstract]]This paper considers a single-machine scheduling problem of minimizing the maximum compl...
AbstractWe consider a scheduling problem with a single machine and a set of jobs which have to be pr...
The computational complexity of the problem of scheduling a set of start-time dependent tasks with d...
International audienceWe consider a natural generalization of classical scheduling problems in which...
[[abstract]]In this paper, we study a scheduling problem of minimizing the total completion time on ...
Author name used in this publication: T. C. E. Cheng2002-2003 > Academic research: refereed > Public...
We consider a range of scheduling problems with controllable processing times, in which the jobs mus...
Author name used in this publication: T. C. E. ChengAuthor name used in this publication: C. T. Ng20...
Abstract. We study single machine scheduling problems, where processing times of the jobs are expone...
AbstractIn the literature, most of the parallel-machine scheduling problems, in which the processing...
We consider the NP-hard problem of scheduling parallel jobs with release dates on identical parallel...
AbstractThis paper deals with single-machine scheduling problems with decreasing linear deterioratio...
We consider the scheduling problem of minimizing the makespan on a single machine with step-improvin...
Author name used in this publication: T. C. E. Cheng2006-2007 > Academic research: refereed > Public...
Production systems often experience a shock or a technological change, resulting in performance impr...
[[abstract]]This paper considers a single-machine scheduling problem of minimizing the maximum compl...
AbstractWe consider a scheduling problem with a single machine and a set of jobs which have to be pr...
The computational complexity of the problem of scheduling a set of start-time dependent tasks with d...
International audienceWe consider a natural generalization of classical scheduling problems in which...
[[abstract]]In this paper, we study a scheduling problem of minimizing the total completion time on ...
Author name used in this publication: T. C. E. Cheng2002-2003 > Academic research: refereed > Public...
We consider a range of scheduling problems with controllable processing times, in which the jobs mus...
Author name used in this publication: T. C. E. ChengAuthor name used in this publication: C. T. Ng20...
Abstract. We study single machine scheduling problems, where processing times of the jobs are expone...
AbstractIn the literature, most of the parallel-machine scheduling problems, in which the processing...
We consider the NP-hard problem of scheduling parallel jobs with release dates on identical parallel...
AbstractThis paper deals with single-machine scheduling problems with decreasing linear deterioratio...