A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems

Research output: Contribution to journalArticle

14 Scopus citations

Abstract

The problem of scheduling n jobs with known process times on m identical parallel machines with an objective of minimizing weighted flow time is NP-hard. However, when job weights are identical, it is well known that the problem is easily solved using the shortest processing time rule. In this paper, we show that a generalization of the shortest processing time rule minimizes weighted flow time in a class of problems where job weights are not identical.

Original languageEnglish (US)
Pages (from-to)327-334
Number of pages8
JournalEuropean Journal of Operational Research
Volume70
Issue number3
DOIs
StatePublished - Nov 12 1993
Externally publishedYes

Keywords

  • Parallel machines
  • Priority rule
  • Scheduling

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems'. Together they form a unique fingerprint.

  • Cite this