Add to ORKGThis paper investigates machine covering problem on m> 3 parallel in-dentical machines with nonsimultaneous machine available times. If the total processing time of all jobs and the largest processing time of all jobs are both known in advance, we can obtain an optimal algorithm with competitive ratio m − 2
Makespan minimization onm identical machines is a fundamental scheduling problem. The goal is to ass...
We study online preemptive makespan minimization on m parallel machines, where the (multiprocessor) ...
AbstractThis paper investigates the semi-online version of scheduling problem P||Cmax on a three-mac...
AbstractThis paper investigates the semi-online machine covering problems on m≥3 parallel identical ...
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that t...
AbstractThe machine covering problem deals with partitioning a sequence of jobs among a set of machi...
AbstractIn this paper, we consider the semi-online preemptive scheduling problem with decreasing job...
We consider the semi-online parallel machine scheduling problem of minimizing the makespan given a p...
International audienceWe consider a semi-online multiprocessor scheduling problem with a given a set...
Abstract. We consider the problem of scheduling a sequence of jobs to m parallel machines as to maxi...
The single machine semi-online scheduling problem with the objective of minimizing total completion ...
Mgr. Tomáš Ebenlendr Combinatorial algorithms for online problems: Semi-online scheduling on related...
We consider the semi-on-line parallel machines scheduling problem with the known total and the large...
We present a unified optimal semi-online algorithm for preemptive scheduling on uni-formly related m...
AbstractIn the majority of works on online scheduling on multipurpose machines the objective is to m...
Makespan minimization onm identical machines is a fundamental scheduling problem. The goal is to ass...
We study online preemptive makespan minimization on m parallel machines, where the (multiprocessor) ...
AbstractThis paper investigates the semi-online version of scheduling problem P||Cmax on a three-mac...
AbstractThis paper investigates the semi-online machine covering problems on m≥3 parallel identical ...
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that t...
AbstractThe machine covering problem deals with partitioning a sequence of jobs among a set of machi...
AbstractIn this paper, we consider the semi-online preemptive scheduling problem with decreasing job...
We consider the semi-online parallel machine scheduling problem of minimizing the makespan given a p...
International audienceWe consider a semi-online multiprocessor scheduling problem with a given a set...
Abstract. We consider the problem of scheduling a sequence of jobs to m parallel machines as to maxi...
The single machine semi-online scheduling problem with the objective of minimizing total completion ...
Mgr. Tomáš Ebenlendr Combinatorial algorithms for online problems: Semi-online scheduling on related...
We consider the semi-on-line parallel machines scheduling problem with the known total and the large...
We present a unified optimal semi-online algorithm for preemptive scheduling on uni-formly related m...
AbstractIn the majority of works on online scheduling on multipurpose machines the objective is to m...
Makespan minimization onm identical machines is a fundamental scheduling problem. The goal is to ass...
We study online preemptive makespan minimization on m parallel machines, where the (multiprocessor) ...
AbstractThis paper investigates the semi-online version of scheduling problem P||Cmax on a three-mac...