Minimizing maximum (weighted) flow-time on related and unrelated machines
type: Item
instance of: scholarly article
title: Minimizing maximum (weighted) flow-time on related and unrelated machines
zbMATH Open document ID: 1358.90040
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Algorithmica
publication date: 2017-03-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6691863
zbMATH Keywords: scheduling
zbMATH Keywords: minimizing flow-time
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive analysis
MaRDI profile type: Publication
full work available at URL: s00453-015-0082-y
OpenAlex ID: W2190420042
cites work: On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
cites work: Meeting Deadlines: How Much Speed Suffices?
cites work: Q5743472
cites work: Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
cites work: The Competitiveness of On-Line Assignments
cites work: On-Line Load Balancing of Temporary Tasks
cites work: Server scheduling in the L p norm
cites work: LATIN 2004: Theoretical Informatics
cites work: Q4250192
cites work: Q4829012
cites work: Q4633926
cites work: Optimal time-critical scheduling via resource augmentation
cites work: All-Norms and All-L_p-Norms Approximation Algorithms
cites work: Q5365024
cites work: Q4252341
DOI: 10.1007/S00453-015-0082-Y
Recommended article: Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
Recommended article: Minimizing maximum flow-time on related machines
Recommended article: Minimizing Maximum Flow-time on Related Machines
Recommended article: Minimizing Flow-Time on Unrelated Machines
Recommended article: Minimizing Average Flow Time on Unrelated Machines
Recommended article: Minimizing average flow time on related machines
Recommended article: Minimizing the total weighted flow time in a single machine with controllable processing times
Recommended article: Q5501310
Recommended article: Better Algorithms for Minimizing Average Flow-Time on Related Machines
Recommended article: A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
description: scientific article; zbMATH DE number 6691863