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.
- parallel processors
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics