On-line scheduling with monotone subsequence constraints.

In this paper, we study an on-line scheduling problem that is motivated by applications such as carpooling. The ride requests arrive on-line over-list and specify the service locations (among m locations). The goal is to determine a schedule that maximizes the number of satisfied requests using k servers. We consider two variants of the problem with respect to constraints on the service location: in the monotone service direction variant, the service locations of the requests assigned to a server must be monotonic; in the strict monotone service direction variant, the service locations must be strictly monotonic. We present lower bounds on the competitive ratio for both variants. For the monotone service direction variant, we give an optimal straightforward algorithm if k ≥ m and we prove that no deterministic on-line algorithm can achieve a constant competitive ratio if k < m. For the strict monotone service direction variant, we give a lower bound max ⁡ { 2 (m − 1) m , 1 } on the competitive ratio of barely deterministic algorithms if k > 2 , and a lower bound of max ⁡ { m 2 , 1 } if k ≤ 2. We propose a Balanced Interval Algorithm for the strict monotone service direction variant if k > 2 and report some numerical experiments to evaluate the efficiency of this algorithm. • We introduce two on-line algorithm problems with monotone service direction constraints which are applied for carpooling system. • We discuss the lower bounds and upper bounds of these two problems. • We propose a balanced interval algorithm and measure the algorithm performance with numerical experiments. [ABSTRACT FROM AUTHOR]