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

Research output: Contribution to journalArticle

4 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)85-90
Number of pages6
JournalOperations Research Letters
Volume14
Issue number2
DOIs
StatePublished - Sep 1993
Externally publishedYes

Keywords

  • parallel processors
  • production/scheduling

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Bounds and asymptotic results for the uniform parallel processor weighted flow time problem'. Together they form a unique fingerprint.

  • Cite this