research
∙
06/09/2023
Semi-online Scheduling with Lookahead
The knowledge of future partial information in the form of a lookahead t...
share
research
∙
01/21/2022
A Note on Hardness of Multiprocessor Scheduling with Scheduling Solution Space Tree
We study the computational complexity of the non-preemptive scheduling p...
research
∙
06/08/2021
New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines
Design and analysis of constant competitive deterministic semi-online al...
research
∙
12/18/2020
Results on Competitiveness of Online Shortest Remaining Processing Time(SRPT) Scheduling with Special Classes of Inputs
Shortest Remaining Processing Time (SRPT) is a well known preemptive sch...
research
∙
05/18/2020
Semi-online Scheduling: A Survey
In online scheduling, jobs are available one by one and each job must be...
research
∙
01/20/2020
A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model
Online scheduling in identical machines with makespan minimization has b...
research
∙
01/17/2020
A New Fairness Model based on User's Objective for Multi-user Multi-processor Online Scheduling
Resources of a multi-user system in multi-processor online scheduling ar...
research
∙
01/14/2020
Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems
Online scheduling has been a well studied and challenging research probl...
research
∙
12/28/2019
New Competitive Analysis Results of Online List Scheduling Algorithm
Online algorithm has been an emerging area of interest for researchers i...
research
∙
12/28/2019