On-line scheduling with non-crossing constraints

Abstract

We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristics for the on-line list and on-line time problems with unit processing times, and a 3-competitive heuristic for the general on-line time problem. © 2008 Elsevier B.V. All rights reserved.