research
∙
10/14/2022
Parallel solutions for ordinal scheduling with a small number of machines
We study ordinal makespan scheduling on small numbers of identical machi...
share
research
∙
10/11/2022
Parallel solutions for preemptive makespan scheduling on two identical machines
We consider online preemptive scheduling of jobs arriving one by one, to...
research
∙
06/13/2022
Bin stretching with migration on two hierarchical machines
In this paper, we consider semi-online scheduling with migration on two ...
research
∙
01/16/2022
Lower bounds on the performance of online algorithms for relaxed packing problems
We prove new lower bounds for suitable competitive ratio measures of two...
research
∙
01/13/2022
Cardinality Constrained Scheduling in Online Models
Makespan minimization on parallel identical machines is a classical and ...
research
∙
07/19/2021
Several methods of analysis for cardinality constrained bin packing
We consider a known variant of bin packing called cardinality constraine...
research
∙
05/18/2021
Online bin packing of squares and cubes
In the d-dimensional online bin packing problem, d-dimensional cubes of ...
research
∙
05/12/2021
Open-end bin packing: new and old analysis approaches
We analyze a recently introduced concept, called the price of clustering...
research
∙
10/14/2020
More on ordered open end bin packing
We consider the Ordered Open End Bin Packing problem. Items of sizes in ...
research
∙
08/03/2020
Truly asymptotic lower bounds for online vector bin packing
In this work, we consider online vector bin packing. It is known that no...
research
∙
08/19/2019
On bin packing with clustering and bin packing with delays
We continue the study of two recently introduced bin packing type proble...
research
∙
04/13/2019
Online Bin Covering with Limited Migration
Semi-online models where decisions may be revoked in a limited way have ...
research
∙
11/23/2018
A lower bound for online rectangle packing
We slightly improve the known lower bound on the asymptotic competitive ...
research
∙
07/15/2018
A new lower bound for classic online bin packing
We improve the lower bound on the asymptotic competitive ratio of any on...
research
∙
08/10/2017