Semi-online Scheduling: A Survey

by   Debasis Dwibedy, et al.

In online scheduling, jobs are available one by one and each job must be scheduled irrevocably before the availability of the next job. Semi-online scheduling is a relaxed variant of online scheduling, where an additional memory in terms of buffer or an Extra Piece of Information(EPI) is provided along with input data. The EPI may include one or more of the parameter(s) such as size of the largest job, total size of all jobs, arrival sequence of the jobs, optimum makespan value or range of job's processing time. A semi-online scheduling algorithm was first introduced in 1997 by Kellerer et al. They envisioned semi-online scheduling as a practically significant model and obtained improved results for 2-identical machine setting. This paper surveys scholarly contributions in the design of semi-online scheduling algorithms in parallel machine models such as identical and uniformly related by considering job's processing formats such as preemptive and non-preemptive with the optimality criteria such as Min-Max and Max-Min. The main focus is to present state of the art competitive analysis results of well-known semi-online scheduling algorithms in a chronological overview. The survey first introduces the online and semi-online algorithmic frameworks for the multi-processor scheduling problem with important applications and research motivation, followed by a taxonomy for semi-online scheduling. Fifteen well-known semi-online scheduling algorithms are stated. Important competitive analysis results are presented in a chronological way by highlighting the critical ideas and intuition behind the results. An evolution time-line of semi-online scheduling setups and a classification of the references based on EPI are outlined. Finally, the survey concludes with the exploration of some of the interesting research challenges and open problems.


page 1

page 2

page 3

page 4


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...

New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines

Design and analysis of constant competitive deterministic semi-online al...

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...

Plan-based Job Scheduling for Supercomputers with Shared Burst Buffers

The ever-increasing gap between compute and I/O performance in HPC platf...

Optimisation of job scheduling for supercomputers with burst buffers

The ever-increasing gap between compute and I/O performance in HPC platf...

Scheduling.jl – Collaborative and Reproducible Scheduling Research with Julia

We introduce the Scheduling.jl Julia package, which is intended for coll...

Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work

In this study, we investigated several online and semi-online scheduling...

Please sign up or login with your details

Forgot password? Click here to reset