Bounds and asymptotic results for the uniform parallel processor weighted flow time problem

Authors:
S. T. Webster
Affiliations:
School of Business, University of Wisconsin-Madison, Madison, Wisconsin, 53706, USA
Venue:
Operations Research Letters
Year:
1993

Citing 6
Cited 1

The asymptotic optimality of the LPT rule

Mathematics of Operations Research
Approximation results in parallel machines stochastic scheduling

Annals of Operations Research
New bounds for the identical parallel processor weighted flow time problem

Management Science
Turnpike optimality of Smith's Rule in parallel machines stochastic scheduling

Mathematics of Operations Research
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Probabilistic analysis of the minimum weighted flowtime scheduling problem

Operations Research Letters

An approximate algorithm for a high-multiplicity parallel machine scheduling problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lower and upper bounds are derived for the NP-hard problem of scheduling n jobs on m parallel processors of different speed with an objective of minimizing weighted flow time. The bounds, which generalize well-known bounds for the identical processor problem, are helpful for understanding asymptotic properties. Asymptotic results for a deterministic model and a stochastic model of the uniform parallel processor weighted flow time problem are noted.