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 the unsplittable flow problem on a path, we are given a capacitated path P and n tasks,
each task having a demand, a profit, and start and end vertices. The goal is to compute a …

We consider two neighboring generalizations of the classical bin packing problem: the
temporal bin packing problem (TBPP) and the temporal bin packing problem with fire-ups …

The increasing number of connected vehicles exacerbates the scarcity of spectrum
resources in vehicle-to-everything (V2X) communication. To optimize the utilization of …

In the Unsplittable Flow on a Path problem (UFP) we are given a path with edge capacities,
and a set of tasks where each task is characterized by a subpath, a demand, and a weight …

The resource allocation problem (RAP) determines a solution to optimally allocate limited
resources to several activities or tasks. In this study, we propose a novel resource allocation …

We study the problem of finding a most profitable subset of n given tasks, each with a given
start and finish time as well as profit and resource requirement, that at no time exceeds the …

We consider a scheduling problem where n jobs have to be carried out by m parallel
identical machines. The attributes of a job j are a fixed start time sj, a fixed finish time fj, a …

We study the problem of unsplittable flow on a path (UFP), which arises naturally in many
applications such as bandwidth allocation, job scheduling, and caching. Here we are given …

In the unsplittable flow on a path problem (UFP) we are given a path with edge capacities
and a collection of tasks. Each task is characterized by a subpath, a profit, and a demand …