Scheduling Bidirectional Traffic on a Path

Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection

We study various versions of the problem of scheduling platoons of autonomous vehicles through an unregulated intersection, where an algorithm must schedule which platoons should wait so that others can go through, so as to minimize the maximum delay for any vehicle. We provide polynomial-time algorithms for constructing such schedules for a $k$-way merge intersection, for constant $k$, and for a crossing intersection involving two-way traffic. We also show that the more general problem of scheduling autonomous platoons through an intersection that includes both a $k$-way merge, for non-consta…

学习增强的带截止期限在线数据包调度

Learning-Augmented Online Packet Scheduling with Deadlines

本文首次研究学习增强的带截止期限在线数据包调度问题，提出一种新颖算法框架，在预测误差小时改善竞争比，并始终保持有界竞争比。

Maintenance scheduling in a railway corricdor

We investigate a novel scheduling problem which is motivated by an application in the Australian railway industry. Given a set of maintenance jobs and a set of train paths over a railway corridor with bidirectional traffic, we seek a schedule of jobs such that a minimum number of train paths are cancelled due to conflict with the job schedule. We show that the problem is NP-complete in general. In a special case of the problem when every job under any schedule just affects one train path, and the speed of trains is bounded from above and below, we show that the problem can be solved in polynom…