Optimal and online preemptive scheduling on uniformly related machines
type: Item
instance of: scholarly article
title: Optimal and online preemptive scheduling on uniformly related machines
zbMATH Open document ID: 1176.90208
author: Tomáš Ebenlendr
author: Jiří Sgall
published in: Journal of Scheduling
publication date: 2009-12-02T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5641492
zbMATH Keywords: online scheduling
zbMATH Keywords: preemption
zbMATH Keywords: uniformly related machines
MaRDI profile type: Publication
full work available at URL: s10951-009-0119-7
OpenAlex ID: W2144626912
cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling
cites work: New algorithms for related machines with temporary jobs.
cites work: On-Line Load Balancing for Related Machines
cites work: An optimal algorithm for preemptive on-line scheduling
cites work: Bounds for List Schedules on Uniform Processors
cites work: Q3619797
cites work: Scheduling Independent Tasks on Uniform Processors
cites work: Preemptive online scheduling: Optimal algorithms for all speeds
cites work: STACS 2004
cites work: Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
cites work: Bin stretching revisited
cites work: Optimal preemptive semi-online scheduling to minimize makespan on two related machines
cites work: Randomized on-line scheduling on two uniform machines
cites work: A lower bound for on-line scheduling on uniformly related machines
cites work: Tighter Bounds for LPT Scheduling on Uniform Processors
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: A Level Algorithm for Preemptive Scheduling
cites work: A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
cites work: Minimizing makespan and preemption costs on a system of uniform machines
cites work: Scheduling Parallel Machines On-Line
cites work: Preemptive on-line scheduling for two uniform processors
cites work: A comment on scheduling on uniform machines under chain-type precedence constraints
DOI: 10.1007/S10951-009-0119-7
description: scientific article; zbMATH DE number 5641492