Weighted flow time bounds for scheduling identical processors

Research output: Contribution to journalArticlepeer-review

23 Scopus citations


We present two lower bounds for the identical parallel processor weighted flow time problem and identify theoretical properties regarding relationships among these and other bounds for the problem. The new bounds, along with other bounds from the literature, are evaluated in a computational study and are found to be among the top three in performance. Conditions favorable to each of the top three performing bounds are identified.

Original languageEnglish (US)
Pages (from-to)103-111
Number of pages9
JournalEuropean Journal of Operational Research
Issue number1
StatePublished - Jan 5 1995
Externally publishedYes


  • Deterministic
  • Parallel shop
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Weighted flow time bounds for scheduling identical processors'. Together they form a unique fingerprint.

Cite this