We present a unified framework for minimizing average completion time for many seemingly
disparate online scheduling problems, such as the traveling repairperson problems (TRP) …

We consider the open, non-preemptive online Dial-a-Ride problem on the real line, where
transportation requests appear over time and need to be served by a single server. We give …

Abstract In the Online Dial-a-Ride Problem (OLDARP), a server travels to serve requests for
rides. We consider a variant where each request specifies a source, destination, release …

We consider a variant of the offline Dial-a-Ride problem on weighted graphs with a single
server where each request has a source and destination. The server's goal is to serve …

We consider the open online dial-a-ride problem, where transportation requests appear
online in a metric space and need to be served by a single server. The objective is to …

Online optimization, in contrast to classical optimization, deals with optimization problems
whose input data is not immediately available, but instead is revealed piece by piece. An …

In the open online dial-a-ride problem, a single server has to deliver transportation requests
appearing over time in some metric space, subject to minimizing the completion time. We …

In this column, we will discuss some papers in online algorithms that appeared in 2019. As
usual, we make no claim at complete coverage here, and have instead made a selection. If …

This paper introduces an online scheduling problem on m identical machines with a metric
state space, which generalizes the classical online scheduling problem on identical …

Unrelated machines are an abstraction of many scheduling environments appearing in
practical applications, where every job may be processed at a different speed on every …