3 papers
cs.DS2021
Machine Covering in the Random-Order Model
Susanne Albers, Waldo Gálvez, Maximilian Janke
In the Online Machine Covering problem jobs, defined by their sizes, arrive one by one and have to be assigned to parallel and identical machines, with the goal of maximizing t…
cs.DS2021
Scheduling in the Secretary Model
Susanne Albers, Maximilian Janke
This paper studies Makespan Minimization in the secretary model. Formally, jobs, specified by their processing times, are presented in a uniformly random order. An online algorithm…
cs.DS2020
Scheduling in the Random-Order Model
Susanne Albers, Maximilian Janke
Makespan minimization on identical machines is a fundamental problem in online scheduling. The goal is to assign a sequence of jobs to identical parallel machines so as to mini…