Add to ORKGAbstract Weconsiderasemi-onlineversionoftheproblemofschedulingasequence of jobs of different lengths on two uniform machines with given speeds 1 and s. Jobs are revealed one by one (the assignment of a job has to be done before the next job is revealed), and the objective is to minimize the makespan. In the considered variant the optimal of?ine makespan is known in advance. The most studied question for this online-type problem is to determine the optimal competitive ratio, that is, the worstcase ratio of the solution given by an algorithm in comparison to the optimal of?in
International audienceIn this paper, we consider the online uniform machine scheduling problem on m ...
AbstractWe consider two problems of online scheduling on two uniform machines: online scheduling und...
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...
AbstractIn this paper we consider the problem of semi-online scheduling on two uniform processors, i...
AbstractThis paper considers two semi-online scheduling problems, one with known optimal value and t...
Makespan minimization onm identical machines is a fundamental scheduling problem. The goal is to ass...
AbstractIn this paper we consider the semi-online scheduling problem with known partial information ...
In this paper we consider the semi-online scheduling problem with known partial information about jo...
Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng20...
We consider the semi-online parallel machine scheduling problem of minimizing the makespan given a p...
In this paper we consider several semi-online scheduling problems on two identical machines with com...
We consider online scheduling of parallel jobs on parallel machines. For the problem with two machin...
AbstractMakespan minimization on m identical machines is a fundamental scheduling problem. The goal ...
Mgr. Tomáš Ebenlendr Combinatorial algorithms for online problems: Semi-online scheduling on related...
International audienceIn this paper, we consider the online uniform machine scheduling problem on m ...
AbstractWe consider two problems of online scheduling on two uniform machines: online scheduling und...
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...
AbstractIn this paper we consider the problem of semi-online scheduling on two uniform processors, i...
AbstractThis paper considers two semi-online scheduling problems, one with known optimal value and t...
Makespan minimization onm identical machines is a fundamental scheduling problem. The goal is to ass...
AbstractIn this paper we consider the semi-online scheduling problem with known partial information ...
In this paper we consider the semi-online scheduling problem with known partial information about jo...
Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng20...
We consider the semi-online parallel machine scheduling problem of minimizing the makespan given a p...
In this paper we consider several semi-online scheduling problems on two identical machines with com...
We consider online scheduling of parallel jobs on parallel machines. For the problem with two machin...
AbstractMakespan minimization on m identical machines is a fundamental scheduling problem. The goal ...
Mgr. Tomáš Ebenlendr Combinatorial algorithms for online problems: Semi-online scheduling on related...
International audienceIn this paper, we consider the online uniform machine scheduling problem on m ...
AbstractWe consider two problems of online scheduling on two uniform machines: online scheduling und...
AbstractThe machine covering problem deals with partitioning a sequence of jobs among a set of machi...