We consider two related scheduling problems: single resource-constrained scheduling on
identical parallel machines and a generalization with resource-dependent processing times …

Consider the many shared resources scheduling problem where jobs have to be scheduled
on identical parallel machines with the goal of minimizing the makespan. However, each job …

We introduce the Mobile Server problem, inspired by current trends to move computational
tasks from cloud structures to multiple devices close to the end user. An example of this is …

We consider the following shared-resource scheduling problem: Given a set of jobs J, for
each j∈ J we must schedule a job-specific processing volume of vj> 0. A total resource of 1 …

Scheduling is one of the most fundamental problems in computer science. A set of jobs has
to be assigned to a set of machines in order to optimize some utility function, often the …

OTF computing is exploring ways to provide people with more customized, on-demand
software services that meet their needs. Similar to using a search engine, users should be …

We consider a scheduling problem with resource-dependent processing speeds in which n
jobs have to be scheduled on m machines that share a common resource. The resource …

In this thesis, we consider the Parallel Task Scheduling problem and several variants. This
problem and its variations have diverse applications in theory and practice; for example …

This thesis covers the topic of resource allocation problems that are tailored to scenarios
primarily involving mobile users. The resources are placed close to the users, eg, at the …

In this thesis we give new algorithmic results to the fields of scheduling problems and integer
programming. The first part gives approximation results to scheduling problems. The …