We consider the budgeted matroid independent set problem. The input is a ground set,
where each element has a cost and a non-negative profit, along with a matroid over the …

In this paper we study the relation of two fundamental problems in scheduling and fair
allocation: makespan minimization on unrelated parallel machines and max-min fair …

This paper deals with the problem of scheduling a set of unit‐time jobs on a set of uniform
machines. The jobs are subject to conflict constraints modeled by a graph G called the …

In this paper, the problem of scheduling on parallel machines with a presence of
incompatibilities between jobs is considered. The incompatibility relation can be modeled as …

We study a family of matroid optimization problems with a linear constraint (MOL). In these
problems, we seek a subset of elements which optimizes (ie, maximizes or minimizes) a …

This paper considers parallel machine scheduling with incompatibilities between jobs. The
jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are …

We consider the Bin Packing problem with a partition matroid constraint. The input is a set of
items of sizes in $(0, 1] $, and a partition matroid over the items. The goal is to pack all items …

Abstract We consider the Bin Packing problem with a partition matroid constraint. The input
is a set of items of sizes in [0, 1], and a partition matroid over the items. The goal is to pack …

We consider a classic machine scheduling problem under resource constraints. Given m
parallel identical machines and a collection of additional but renewable resources, each …

In this paper, we consider a new industrial problem that occurs in the automobile industry's
context during the testing phase of a new vehicle model. A vehicle model is sold in different …