Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing.
Operations Research Proceedings(2018)
摘要
Completing possibly unforeseen tasks in a timely manner is vital for many real-world problems: For instance, in hospitals, emergency patients may come in and require to be treated, or self-driving cars need to avoid obstacles appearing on the street. Under the hard constraint of timely fulfilling these tasks, one still usually wishes to use resources conscientiously. We consider the above applications in the form of two fundamental mathematical problems. First, in online deadline scheduling, jobs arrive over time and need to scheduled on a machine until their deadline. Second, in convex-body chasing, an agent needs to immediately serve tasks located within convex regions and minimize the total travelled distance. In this paper we review the main results we obtained in the thesis of the same title: We present various novel online algorithms and techniques for analyzing them. Thereby we improve upon previously known bounds.
更多查看译文
关键词
Online optimization, Resource augmentation, Competitive analysis, Deadline scheduling, Convex-body chasing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络