Online scheduling of bounded length jobs to maximize throughput
type: Item
instance of: scholarly article
title: Online scheduling of bounded length jobs to maximize throughput
zbMATH Open document ID: 1280.68296
author: Christoph Dürr
author: Łukasz Jeż
author: Nguyen Kim Thang
published in: Journal of Scheduling
publication date: 2014-02-05T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6255160
zbMATH Keywords: online scheduling
zbMATH Keywords: preemption with resume
zbMATH Keywords: competitive analysis
zbMATH Keywords: online algorithms
MaRDI profile type: MaRDI publication profile
full work available at URL: s10951-011-0233-1
OpenAlex ID: W2567863272
cites work: Q3128890
cites work: An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
cites work: Preemptive scheduling of equal-length jobs to maximize weighted throughput.
cites work: On-line scheduling to maximize task completions.
cites work: Bounding the Power of Preemption in Randomized Scheduling
cites work: Computing and Combinatorics
cites work: Q4247460
cites work: Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
cites work: Considering suppressed packets improves buffer management in QoS switches
cites work: Speed is as powerful as clairvoyance
cites work: Maximizing job completions online
cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
cites work: A near optimal scheduler for on-demand data broadcasts
DOI: 10.1007/S10951-011-0233-1
Recommended article: Online Scheduling of Bounded Length Jobs to Maximize Throughput
Recommended article: Improved online scheduling in maximizing throughput of equal length jobs
Recommended article: Maximizing the Throughput of Multiple Machines On-Line
Recommended article: STACS 2004
Recommended article: A competitive algorithm for throughput maximization on identical machines
copyright license: Creative Commons Attribution-NonCommercial 4.0 International
description: scientific article; zbMATH DE number 6255160