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

Research output: Contribution to journalArticle

14 Citations (Scopus)

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

Fingerprint

Priority Rules
Parallel Machine Scheduling
Flow Time
scheduling
Scheduling Problem
Scheduling
Processing
Identical Parallel Machines
NP-complete problem
Minimise
Class
time
Flow time
Parallel machine scheduling
Priority rules

Keywords

  • Parallel machines
  • Priority rule
  • Scheduling

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

@article{622506b5ec504f2a9c0e762c28a3b588,
title = "A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems",
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.",
keywords = "Parallel machines, Priority rule, Scheduling",
author = "Scott Webster",
year = "1993",
month = "11",
day = "12",
doi = "10.1016/0377-2217(93)90244-H",
language = "English (US)",
volume = "70",
pages = "327--334",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

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

AU - Webster, Scott

PY - 1993/11/12

Y1 - 1993/11/12

N2 - 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.

AB - 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.

KW - Parallel machines

KW - Priority rule

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=0027906580&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027906580&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(93)90244-H

DO - 10.1016/0377-2217(93)90244-H

M3 - Article

AN - SCOPUS:0027906580

VL - 70

SP - 327

EP - 334

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -