An algorithm for flow time minimization and its asymptotic makespan properties

DOI10.1016/0020-0190(92)90027-SzbMath0780.68069MaRDI QIDQ1198009

Li-Hui Tsai

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmsmakespandesign of algorithmsmean flow timeparallel machine scheduling problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distribution-free bounds on the expectation of the maximum with scheduling applications
• A strong limit theorem for the oscillation modulus of the uniform empirical quantile process
• Approximation results in parallel machines stochastic scheduling
• Approximate distributions of order statistics. With applications to nonparametric statistics
• Algorithms minimizing mean flow time: Schedule-length properties
• A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors
• The Asymptotic Optimality of the LPT Rule
• Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
• Performance Guarantees for Scheduling Algorithms
• Scheduling independent tasks to reduce mean finishing time
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: An algorithm for flow time minimization and its asymptotic makespan properties