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

Research output: Contribution to journalArticle

4 Citations (Scopus)

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 - 1993
Externally publishedYes

Fingerprint

Parallel Processors
Flow Time
Stochastic models
Computational complexity
Scheduling
Deterministic Model
NP-hard Problems
Asymptotic Properties
Stochastic Model
Upper and Lower Bounds
Generalise
Flow time
NP-hard
Asymptotic properties
Lower bounds
Upper bound
Stochastic model

Keywords

  • parallel processors
  • production/scheduling

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Discrete Mathematics and Combinatorics
  • Modeling and Simulation

Cite this

Bounds and asymptotic results for the uniform parallel processor weighted flow time problem. / Webster, Scott.

In: Operations Research Letters, Vol. 14, No. 2, 1993, p. 85-90.

Research output: Contribution to journalArticle

@article{502bc478de914160b364d7f1501d192c,
title = "Bounds and asymptotic results for the uniform parallel processor weighted flow time problem",
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.",
keywords = "parallel processors, production/scheduling",
author = "Scott Webster",
year = "1993",
doi = "10.1016/0167-6377(93)90100-U",
language = "English (US)",
volume = "14",
pages = "85--90",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

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

AU - Webster, Scott

PY - 1993

Y1 - 1993

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

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

KW - parallel processors

KW - production/scheduling

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

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

U2 - 10.1016/0167-6377(93)90100-U

DO - 10.1016/0167-6377(93)90100-U

M3 - Article

AN - SCOPUS:0027666803

VL - 14

SP - 85

EP - 90

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 2

ER -