Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
type: Item
instance of: scholarly article
title: Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
author: Asaf Levin
published in: Information Processing Letters
publication date: 2021-12-14T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7444825
zbMATH Keywords: scheduling
zbMATH Keywords: robust algorithms
zbMATH Keywords: migration factor
zbMATH Keywords: online algorithms
zbMATH Keywords: analysis of algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2021.106211
OpenAlex ID: W3202877791
cites work: Using fast matrix multiplication to find basic solutions
cites work: Q3182207
cites work: Online Bin Covering with Limited Migration
cites work: Fully dynamic bin packing revisited
cites work: An optimal algorithm for preemptive on-line scheduling
cites work: Preemptive online scheduling: Optimal algorithms for all speeds
cites work: Optimal and online preemptive scheduling on uniformly related machines
cites work: A robust APTAS for the classical bin packing problem
cites work: Robust approximation schemes for cube packing
cites work: Robust algorithms for preemptive scheduling
cites work: Robust algorithms for total completion time
cites work: A lower bound for on-line scheduling on uniformly related machines
cites work: Optimal preemptive scheduling for general target functions
cites work: Fully-Dynamic Bin Packing with Little Repacking
cites work: Symmetry exploitation for online machine covering with bounded migration
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: A Level Algorithm for Preemptive Scheduling
cites work: A Robust AFPTAS for Online Bin Packing with Polynomial Migration
cites work: Q5002616
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Q4051611
cites work: Scheduling with deadlines and loss functions
cites work: Online Scheduling with Bounded Migration
cites work: Minimizing makespan and preemption costs on a system of uniform machines
cites work: Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
DOI: 10.1016/J.IPL.2021.106211
description: scientific article; zbMATH DE number 7444825