Author name used in this publication: T.C.E. ChengAuthor name used in this publication: C. T. Ng2005-2006 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
AbstractWe consider preemptive offline and online scheduling on identical machines and uniformly rel...
AbstractWe study two online problems on m uniform machines with speeds s1≤⋯≤sm. The problems are onl...
International audienceIn this paper, we consider the online uniform machine scheduling problem on m ...
In the classic minimum makespan scheduling problem, we are given an input sequence of n jobs with si...
In the classic minimum makespan scheduling problem, we are given an input sequence of n jobs with si...
We consider online scheduling on multiple machines for jobs arriving one-by-one with the objective o...
AbstractIn this paper, we investigate the online scheduling problem on two uniform machines, where t...
We study online scheduling on m uniform machines, where m−1 of them have a reference speed 1 and the...
Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng20...
AbstractWe consider two problems of online scheduling on two uniform machines: online scheduling und...
We consider the online makespan minimization problem on identical machines. Chen and Vestjens (ORL 1...
AbstractThis paper considers the online scheduling problem with machine cost. We are given a sequenc...
AbstractThe machine covering problem deals with partitioning a sequence of jobs among a set of machi...
We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengt...
AbstractThis paper considers two semi-online scheduling problems, one with known optimal value and t...
AbstractWe consider preemptive offline and online scheduling on identical machines and uniformly rel...
AbstractWe study two online problems on m uniform machines with speeds s1≤⋯≤sm. The problems are onl...
International audienceIn this paper, we consider the online uniform machine scheduling problem on m ...
In the classic minimum makespan scheduling problem, we are given an input sequence of n jobs with si...
In the classic minimum makespan scheduling problem, we are given an input sequence of n jobs with si...
We consider online scheduling on multiple machines for jobs arriving one-by-one with the objective o...
AbstractIn this paper, we investigate the online scheduling problem on two uniform machines, where t...
We study online scheduling on m uniform machines, where m−1 of them have a reference speed 1 and the...
Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng20...
AbstractWe consider two problems of online scheduling on two uniform machines: online scheduling und...
We consider the online makespan minimization problem on identical machines. Chen and Vestjens (ORL 1...
AbstractThis paper considers the online scheduling problem with machine cost. We are given a sequenc...
AbstractThe machine covering problem deals with partitioning a sequence of jobs among a set of machi...
We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengt...
AbstractThis paper considers two semi-online scheduling problems, one with known optimal value and t...
AbstractWe consider preemptive offline and online scheduling on identical machines and uniformly rel...
AbstractWe study two online problems on m uniform machines with speeds s1≤⋯≤sm. The problems are onl...
International audienceIn this paper, we consider the online uniform machine scheduling problem on m ...
DOI
Add to ORKG