Scheduling is essentially a decision-making process that enables resource sharing among a
number of activities by determining their execution order on the set of available resources …

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 …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

The study of combinatorial problems with a submodular objective function has attracted
much attention in recent years, and is partly motivated by the importance of such problems to …

We present a general framework for solving resource allocation and scheduling problems.
Given a resource of fixed size, we present algorithms that approximate the maximum …

We present the first coupled formal and empirical analysis of the Satellite Range Scheduling
application. We structure our study as a progression; we start by studying a simplified …

The location of facilities in order to provide service for customers is a well-studied problem in
the operations research literature. In the basic model, there is a predefined cost for opening …

A goal of this paper is to efficiently adapt the best ingredients of the graph colouring
techniques to an NP-hard satellite range scheduling problem, called MuRRSP. We propose …

The enormous complexity of biological systems at the molecular level must be answered
with powerful computational methods. Computational biology is a young field, but has seen …

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 …