In interval scheduling, not only the processing times of the jobs but also their starting times
are given. This article surveys the area of interval scheduling and presents proofs of results …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

We show that for an interval graph given in the form of a family of intervals, a maximum
independent set, a minimum covering by disjoint completely connected sets or cliques, and …

The defining characteristic of fixed interval scheduling problems is that each job has a finite
number of fixed processing intervals. A job can be processed only in one of its intervals on …

In this paper we consider the problem of routing trains through railway stations. This problem
occurs as a subproblem in the project DONS that is currently being carried out under the …

Packet radio networks are modeled as arbitrary graphs by most researchers. In this paper
we show that an arbitrary graph is an inaccurate model of the radio networks. This is true …

Vehicle scheduling is the process of assigning vehicles to a set of predetermined trips with
fixed starting and ending times, while minimizing capital and operating costs. This paper …

We consider the NP-hard Multiple Depot Vehicle Scheduling Problem, in which a given set
of time-tabled trips have to be assigned to vehicles stationed at different depots, so as to …

In this paper we introduce the Personnel Task Scheduling Problem (PTSP) and provide
solution algorithms for a variant of this problem known as the Shift Minimisation Personnel …

We consider a generalization of the fixed job schedule problem in which each processor is
available only for a prefixed time interval from the release time of the earliest task assigned …