Weighted flow time bounds for scheduling identical processors

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

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
Volume80
Issue number1
DOIs
StatePublished - Jan 5 1995
Externally publishedYes

Fingerprint

Flow Time
scheduling
Scheduling
Parallel Processors
performance
Lower bound
time
Flow time
literature

Keywords

  • Deterministic
  • Parallel shop
  • Scheduling

ASJC Scopus subject areas

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

Cite this

Weighted flow time bounds for scheduling identical processors. / Webster, Scott.

In: European Journal of Operational Research, Vol. 80, No. 1, 05.01.1995, p. 103-111.

Research output: Contribution to journalArticle

@article{671494586ed2462cb397ccbc11fb9a81,
title = "Weighted flow time bounds for scheduling identical processors",
abstract = "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.",
keywords = "Deterministic, Parallel shop, Scheduling",
author = "Scott Webster",
year = "1995",
month = "1",
day = "5",
doi = "10.1016/0377-2217(93)E0142-K",
language = "English (US)",
volume = "80",
pages = "103--111",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Weighted flow time bounds for scheduling identical processors

AU - Webster, Scott

PY - 1995/1/5

Y1 - 1995/1/5

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

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

KW - Deterministic

KW - Parallel shop

KW - Scheduling

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

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

U2 - 10.1016/0377-2217(93)E0142-K

DO - 10.1016/0377-2217(93)E0142-K

M3 - Article

AN - SCOPUS:0029636124

VL - 80

SP - 103

EP - 111

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -