Robust algorithms for total completion time
type: Item
instance of: scholarly article
title: Robust algorithms for total completion time
zbMATH Open document ID: 1506.90097
author: Leah Epstein
author: Asaf Levin
published in: Discrete Optimization
publication date: 2019-11-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C17
zbMATH DE Number: 7138062
zbMATH Keywords: scheduling
zbMATH Keywords: bounded migration factor
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: j.disopt.2019.03.001
OpenAlex ID: W2930331340
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines
cites work: Q4658190
cites work: Q3425131
cites work: Scheduling
cites work: Minimizing average completion time in the presence of release dates
cites work: Optimal on-line algorithms for single-machine scheduling
cites work: A class of on-line scheduling algorithms to minimize total completion time
cites work: Online Scheduling with Bounded Migration
cites work: A robust APTAS for the classical bin packing problem
cites work: Robust algorithms for preemptive scheduling
cites work: A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
cites work: Q5351895
cites work: Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
cites work: Robust approximation schemes for cube packing
cites work: Q5002616
cites work: Load Balancing for Response Time
cites work: Improved bounds for on-line load balancing
cites work: A theory and algorithms for combinatorial reoptimization
cites work: Approximation techniques for average completion time scheduling
cites work: Q3651735
DOI: 10.1016/J.DISOPT.2019.03.001
description: scientific article; zbMATH DE number 7138062