This work examines a strongly NP-hard routing problem on trees, in which multiple servers
need to serve a given set of requests (on vertices), where the routes of the servers start from …

Distributed memory modern HPC systems consist of millions of compute nodes
interconnected via a high-performance network. These systems are shared among …

Cloud computing develops rapidly in recent years and provides service to many
applications, in which job scheduling becomes more and more important to improve 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 study a practical production planning problem that was encountered by an industrial
partner. Mathematically, the problem can be described as an unrelated parallel machine …

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 …

OTF compute centers are intended to exploit and support the characteristics of OTF services.
They also are expected to exist at various scale, ranging from full-fledged data centers down …

Consider a scheduling problem in which jobs need to be processed on a single machine.
Each job has a weight and is composed of several operations belonging to different families …

Makespan minimization on identical parallel machines, or machine scheduling for short, is a
fundamental problem in combinatorial optimization. In this problem, a set of jobs with …

The occurrence of setup times for the preparation of machines is a natural assumption when
considering scheduling problems. They may occur, for example, as startup times for …