Modern resource management frameworks for largescale analytics leave unresolved the
problematic tension between high cluster utilization and job's performance predictability …

We present a new cluster scheduler, GRAPHENE, aimed at jobs that have a complex
dependency structure and heterogeneous resource demands. Relaxing either of these …

We study the strip packing problem, in which a set of two-dimensional rectangular items has
to be packed in a rectangular strip of fixed width and infinite height, with the aim of …

Bin packing problem (BPP) is one of the fastest-growing research issues within the field of
combinatorial optimization. Over the last years, several studies carried out various BPP …

Given a set of identical capacitated bins, a set of weighted items, and a set of precedences
among such items, we are interested in determining the minimum number of bins that can …

The bin packing problem with precedence constraints (BPP-P) is a recently proposed
variation of the classical bin packing problem (BPP), which corresponds to a basic model …

Scheduling malleable tasks under general precedence constraints involves finding a
minimum makespan (maximum completion time) by a feasible allotment. Based on the …

This article addresses the Strip Packing Problem with Unloading Constraints (SPU). In this
problem, we are given a strip of fixed width and unbounded height, and n items of C different …

In this paper, we propose a generalisation of the bin packing problem, obtained by adding
precedences between items that can assume heterogeneous non-negative integer values …

We use the Positions and Covering methodology to obtain exact solutions for the two-
dimensional, non-guillotine restricted, strip packing problem. In this classical NP-hard …