Mixed-integer linear programming (MILP) is at the core of many advanced
...
In the moldable job scheduling problem one has to assign a set of n jobs...
We study a mutually enriching connection between response time analysis ...
Consider the many shared resource scheduling problem where jobs have to ...
In high-multiplicity scheduling, jobs of the same size are encoded in an...
We study the d-dimensional hypercube knapsack problem where we are given...
In parallel machine scheduling, we are given a set of jobs, together wit...
There is a long history of approximation schemes for the problem of
sche...
In the problem called single resource constraint scheduling, we are give...
We study Nonpreemptive Peak Demand Minimization (NPDM) problem, where we...
Semi-online algorithms that are allowed to perform a bounded amount of
r...
The weighted maximal bisection problem is, given an edge weighted graph,...
This paper considers parallel machine scheduling with incompatibilities
...
We consider ILPs, where each variable corresponds to an integral point w...
We consider fundamental algorithmic number theoretic problems and their
...
The vertices of the integer hull are the integral equivalent to the
well...
We introduce a very natural generalization of the well-known problem of
...
In some important application areas of hard real-time systems, preemptiv...
Assigning jobs onto identical machines with the objective to minimize th...
In the restricted assignment problem, the input consists of a set of mac...
We study approximation algorithms for the problem of minimizing the make...
Online algorithms that allow a small amount of migration or recourse hav...
Semi-online models where decisions may be revoked in a limited way have ...
We study the Multiple Cluster Scheduling problem and the Multiple Strip
...
Graph Balancing is the problem of orienting the edges of a weighted
mult...
We study an important case of ILPs {c^Tx Ax = b, l
≤ x ≤ u, x ∈Z^n t...
Machine scheduling is a fundamental optimization problem in computer sci...
We investigate the scheduling of n jobs divided into c classes/batches o...
We consider a natural generalization of scheduling n jobs on m parallel
...
In the restricted Santa Claus problem we are given resources R and
play...
Integer programs with a fixed number of constraints can be solved in
pse...
Integer linear programs of configurations, or configuration IPs, are a
c...
We study pseudo-polynomial Strip Packing. Given a set of rectangular axi...
A moldable job is a job that can be executed on an arbitrary number of
p...