Add to ORKGThis paper considers two semi-online scheduling problems, one with known optimal value and the other with known total sum, on two uniform machines with a machine speed ratio of s ≥ 1. For the first problem, we provide an optimal algorithm for s ∈ [ 1+
AbstractIn this paper we consider the semi-online scheduling problem with known partial information ...
AbstractIn this paper, we investigate the online scheduling problem on two uniform machines, where t...
Mgr. Tomáš Ebenlendr Combinatorial algorithms for online problems: Semi-online scheduling on related...
AbstractThis paper considers two semi-online scheduling problems, one with known optimal value and t...
This paper considers two semi-online scheduling problems, one with known optimal value and the other...
AbstractIn this paper we consider the problem of semi-online scheduling on two uniform processors, i...
In this paper we consider several semi-online scheduling problems on two identical machines with com...
Abstract Weconsiderasemi-onlineversionoftheproblemofschedulingasequence of jobs of different lengths...
AbstractThis paper investigates the online scheduling on three uniform machines problem. Denote by s...
We consider the online scheduling of two machines under a grade of service (GoS) provision and its s...
We consider the Online Uniform Machine Scheduling problem on m machines in the case when speed si = ...
International audienceIn this paper, we consider the online uniform machine scheduling problem on m ...
AbstractWe study two online problems on m uniform machines with speeds s1≤⋯≤sm. The problems are onl...
AbstractIn semi-online scheduling problems, we always assume that some partial additional informatio...
In this paper we consider the semi-online scheduling problem with known partial information about jo...
AbstractIn this paper we consider the semi-online scheduling problem with known partial information ...
AbstractIn this paper, we investigate the online scheduling problem on two uniform machines, where t...
Mgr. Tomáš Ebenlendr Combinatorial algorithms for online problems: Semi-online scheduling on related...
AbstractThis paper considers two semi-online scheduling problems, one with known optimal value and t...
This paper considers two semi-online scheduling problems, one with known optimal value and the other...
AbstractIn this paper we consider the problem of semi-online scheduling on two uniform processors, i...
In this paper we consider several semi-online scheduling problems on two identical machines with com...
Abstract Weconsiderasemi-onlineversionoftheproblemofschedulingasequence of jobs of different lengths...
AbstractThis paper investigates the online scheduling on three uniform machines problem. Denote by s...
We consider the online scheduling of two machines under a grade of service (GoS) provision and its s...
We consider the Online Uniform Machine Scheduling problem on m machines in the case when speed si = ...
International audienceIn this paper, we consider the online uniform machine scheduling problem on m ...
AbstractWe study two online problems on m uniform machines with speeds s1≤⋯≤sm. The problems are onl...
AbstractIn semi-online scheduling problems, we always assume that some partial additional informatio...
In this paper we consider the semi-online scheduling problem with known partial information about jo...
AbstractIn this paper we consider the semi-online scheduling problem with known partial information ...
AbstractIn this paper, we investigate the online scheduling problem on two uniform machines, where t...
Mgr. Tomáš Ebenlendr Combinatorial algorithms for online problems: Semi-online scheduling on related...