Competitive algorithms for multistage online scheduling
type: Item
instance of: scholarly article
title: Competitive algorithms for multistage online scheduling
zbMATH Open document ID: 1403.90335
author: Michael Hopf
author: Clemens Thielen
author: Oliver Wendt
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
full work available at URL: Competitive Algorithms for Multistage Online Scheduling.pdf
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6875784
zbMATH Keywords: scheduling
zbMATH Keywords: online optimization
zbMATH Keywords: competitive analysis
describes a project that uses: MapReduce
MaRDI profile type: Publication
OpenAlex ID: W2567804193
cites work: Scheduling jobs with fixed start and end times
cites work: Online selection of intervals and \(t\)-intervals
cites work: Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
cites work: Scheduling Split Intervals
cites work: A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
cites work: Q4432280
cites work: Q4223058
cites work: Interval scheduling on identical machines
cites work: Bounding the Power of Preemption in Randomized Scheduling
cites work: On the \(k\)-coloring of intervals
cites work: Q4252286
cites work: Programming with linear fractional functionals
cites work: Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes
cites work: Improved Randomized Results for That Interval Selection Problem
cites work: Note on scheduling intervals on-line
cites work: Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
cites work: Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
cites work: Q4886045
cites work: Online independent sets.
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: Interval scheduling on related machines
cites work: Optimization, approximation, and complexity classes
cites work: On-line scheduling of jobs with fixed start and end times
DOI: 10.1016/J.EJOR.2016.12.047
description: scientific article; zbMATH DE number 6875784