The knowledge of future partial information in the form of a lookahead t...
We study the computational complexity of the non-preemptive scheduling
p...
Design and analysis of constant competitive deterministic semi-online
al...
Shortest Remaining Processing Time (SRPT) is a well known preemptive
sch...
The design and analysis of efficient algorithms with the knowledge of cu...
In this paper we propose a novel online deterministic list update algori...
In online scheduling, jobs are available one by one and each job must be...
Online scheduling in identical machines with makespan minimization has b...
Resources of a multi-user system in multi-processor online scheduling ar...
Online scheduling has been a well studied and challenging research probl...
Online algorithm has been an emerging area of interest for researchers i...
Rainbow coloring is a special case of edge coloring, where there must be...
CPU being considered a primary computer resource, its scheduling is cent...
In this paper, we have proposed a new variant of Round Robin scheduling
...
In this paper, a new variant of Round Robin (RR) algorithm is proposed w...
Scheduling is the central concept used frequently in Operating System. I...