Scheduling In the random-order model
type: Item
instance of: scholarly article
title: Scheduling In the random-order model
author: Susanne Albers
author: Maximilian Janke
published in: Algorithmica
publication date: 2021-09-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/2006.00386
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7390202
zbMATH Keywords: scheduling
zbMATH Keywords: makespan minimization
zbMATH Keywords: online algorithm
zbMATH Keywords: competitive analysis
zbMATH Keywords: lower bound
zbMATH Keywords: random-order
MaRDI profile type: Publication
OpenAlex ID: W3167755729
cites work: Better Bounds for Online Scheduling
cites work: A Knapsack Secretary Problem with Applications
cites work: Matroid Secretary Problems
cites work: New algorithms for an ancient scheduling problem.
cites work: A better lower bound for on-line scheduling
cites work: A lower bound for randomized on-line scheduling algorithms
cites work: Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming
cites work: Semi-on-line multiprocessor scheduling with given total processing time
cites work: Online Makespan Scheduling with Sublinear Advice
cites work: Q5653410
cites work: The Power of Reordering for Online Minimum Makespan Scheduling
cites work: Q3031924
cites work: A Simple O(log log(rank)) -Competitive Algorithm for the Matroid Secretary Problem
cites work: On-line scheduling revisited
cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
cites work: Online Appointment Scheduling in the Random Order Model
cites work: Q3579420
cites work: Q4952670
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Q5002749
cites work: Online bipartite matching with unknown distributions
cites work: A Better Algorithm for an Ancient Scheduling Problem
cites work: An efficient algorithm for bin stretching
cites work: Semi on-line algorithms for the partition problem
cites work: Q4875207
cites work: Primal beats dual on online packing LPs in the random-order model
cites work: A multiple-choice secretary algorithm with applications to online auctions
cites work: Online bipartite matching with random arrivals
cites work: Online and Random-order Load Balancing Simultaneously
cites work: List's worst-average-case or WAC ratio
cites work: Improved Bounds for the Online Scheduling Problem
cites work: Online Scheduling with Bounded Migration
cites work: A lower bound for randomized on-line multiprocessor scheduling
DOI: 10.1007/S00453-021-00841-8
Recommended article: Q3726172
Recommended article: Order Scheduling Models: Hardness and Algorithms
Recommended article: Q3714888
Recommended article: Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
Recommended article: On a stochastic sequencing and scheduling problem
Recommended article: Online Appointment Scheduling in the Random Order Model
Recommended article: Scheduling problems in a practical allocation model
Recommended article: Randomized scheduling algorithm for queueing networks
Recommended article: Random scheduling with deadlines under dichotomous preferences
Recommended article: Optimal stochastic scheduling
description: scientific article; zbMATH DE number 7390202