Online scheduling has been a well studied and challenging research problem over the last five decades since the pioneering work of Graham with immense practical significance in various applications such as interactive parallel processing, routing in communication networks, distributed data management, client-server communications, traffic management in transportation, industrial manufacturing and production. In this problem, a sequence of jobs is received one 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 machine before the availability of the next job with an objective to minimize the completion time of the scheduled jobs. This paper highlights the state of the art contributions for online scheduling of a sequence of independent jobs on identical and uniform related machines with a special focus on preemptive and non-preemptive processing formats by considering makespan minimization as the optimality criterion. We present the fundamental aspects of online scheduling from a beginner's perspective along with a background of general scheduling framework. Important competitive analysis results obtained by well-known deterministic and randomized online scheduling algorithms in the literature are presented along with research challenges and open problems. Two of the emerging recent trends such as resource augmentation and semi-online scheduling are discussed as a motivation for future research work.

中文翻译：

---

使用 Makespan 最小化的在线调度：最新成果、研究挑战和开放性问题

自从 Graham 的开创性工作以来，在过去的 50 年中，在线调度一直是一个深入研究和具有挑战性的研究问题，在交互式并行处理、通信网络中的路由、分布式数据管理、客户端-服务器通信、流量等各种应用中具有巨大的实际意义运输、工业制造和生产的管理。在这个问题中，调度器按顺序依次接收一系列作业，以便在多台机器上进行调度。作业到达时，调度程序在下一个作业可用之前将作业不可撤销地分配给机器，目的是最小化调度作业的完成时间。本文重点介绍了在相同和统一的相关机器上在线调度一系列独立作业的最新贡献，特别关注抢占式和非抢占式处理格式，将完工时间最小化作为最优标准。我们从初学者的角度介绍了在线调度的基本方面以及一般调度框架的背景。通过文献中著名的确定性和随机在线调度算法获得的重要竞争分析结果与研究挑战和开放问题一起呈现。讨论了最近出现的两个趋势，例如资源增加和半在线调度，作为未来研究工作的动力。s 视角以及通用调度框架的背景。通过文献中著名的确定性和随机在线调度算法获得的重要竞争分析结果与研究挑战和开放问题一起呈现。讨论了最近出现的两个趋势，例如资源增加和半在线调度，作为未来研究工作的动力。s 视角以及通用调度框架的背景。通过文献中著名的确定性和随机在线调度算法获得的重要竞争分析结果与研究挑战和开放问题一起呈现。讨论了最近出现的两个趋势，例如资源增加和半在线调度，作为未来研究工作的动力。