English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Online scheduling has been a well studied and challenging research problemover the last five decades since the pioneering work of Graham with immensepractical significance in various applications such as interactive parallelprocessing, routing in communication networks, distributed data management,client-server communications, traffic management in transportation, industrialmanufacturing and production. In this problem, a sequence of jobs is receivedone by one in order by the scheduler for scheduling over a number of machines.On arrival of a job, the scheduler assigns the job irrevocably to a machinebefore the availability of the next job with an objective to minimize thecompletion time of the scheduled jobs. This paper highlights the state of theart contributions for online scheduling of a sequence of independent jobs onidentical and uniform related machines with a special focus on preemptive andnon-preemptive processing formats by considering makespan minimization as theoptimality criterion. We present the fundamental aspects of online schedulingfrom a beginner's perspective along with a background of general schedulingframework. Important competitive analysis results obtained by well-knowndeterministic and randomized online scheduling algorithms in the literature arepresented along with research challenges and open problems. Two of the emergingrecent trends such as resource augmentation and semi-online scheduling arediscussed as a motivation for future research work.

Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems