An algorithm for flow time minimization and its asymptotic makespan properties
type: Item
instance of: scholarly article
title: An algorithm for flow time minimization and its asymptotic makespan properties
zbMATH Open document ID: 0780.68069
DOI: 10.1016/0020-0190(92)90027-S
author: Li-Hui Tsai
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 92081
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: design of algorithms
zbMATH Keywords: parallel machine scheduling problem
zbMATH Keywords: mean flow time
zbMATH Keywords: makespan
MaRDI profile type: Publication
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Q4051615
cites work: Q4131987
cites work: A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors
cites work: Algorithms minimizing mean flow time: Schedule-length properties
cites work: Q3339028
cites work: Distribution-free bounds on the expectation of the maximum with scheduling applications
cites work: The Asymptotic Optimality of the LPT Rule
cites work: Performance Guarantees for Scheduling Algorithms
cites work: Q4198056
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: A strong limit theorem for the oscillation modulus of the uniform empirical quantile process
cites work: Approximate distributions of order statistics. With applications to nonparametric statistics
cites work: Q3857500
cites work: Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
cites work: Approximation results in parallel machines stochastic scheduling
description: scientific article; zbMATH DE number 92081