'LARGEST VARIANCE FIRST' POLICY IN SOME STOCHASTIC SCHEDULING PROBLEMS.

Michael Pinedo; Gideon Weiss

doi:10.1287/opre.35.6.884

'LARGEST VARIANCE FIRST' POLICY IN SOME STOCHASTIC SCHEDULING PROBLEMS.

Research output: Contribution to journal › Article › peer-review

Abstract

We consider a situation in which n jobs, requiring random amounts of processing, all with the same mean, are to be scheduled on m parallel machines with respect to one of two objectives: expected flowtime and expected makespan. We discuss optimality of the rule that says to schedule the jobs with the largest variance first (LVF). We show that for some very simple job length distributions, LVF minimizes both the expected flowtime and the expected makespan.

Original language	English
Pages (from-to)	884-891
Number of pages	8
Journal	Operations Research
Volume	35
Issue number	6
DOIs	https://doi.org/10.1287/opre.35.6.884
State	Published - 1987
Externally published	Yes

ASJC Scopus subject areas

Computer Science Applications
Management Science and Operations Research

Access to Document

10.1287/opre.35.6.884

Cite this

@article{f3e3d1bf374146e6adea43bec9dd10ad,

title = "'LARGEST VARIANCE FIRST' POLICY IN SOME STOCHASTIC SCHEDULING PROBLEMS.",

abstract = "We consider a situation in which n jobs, requiring random amounts of processing, all with the same mean, are to be scheduled on m parallel machines with respect to one of two objectives: expected flowtime and expected makespan. We discuss optimality of the rule that says to schedule the jobs with the largest variance first (LVF). We show that for some very simple job length distributions, LVF minimizes both the expected flowtime and the expected makespan.",

author = "Michael Pinedo and Gideon Weiss",

year = "1987",

doi = "10.1287/opre.35.6.884",

language = "English",

volume = "35",

pages = "884--891",

journal = "Operations Research",

issn = "0030-364X",

publisher = "INFORMS Institute for Operations Research and the Management Sciences",

number = "6",

}

TY - JOUR

T1 - 'LARGEST VARIANCE FIRST' POLICY IN SOME STOCHASTIC SCHEDULING PROBLEMS.

AU - Pinedo, Michael

AU - Weiss, Gideon

PY - 1987

Y1 - 1987

N2 - We consider a situation in which n jobs, requiring random amounts of processing, all with the same mean, are to be scheduled on m parallel machines with respect to one of two objectives: expected flowtime and expected makespan. We discuss optimality of the rule that says to schedule the jobs with the largest variance first (LVF). We show that for some very simple job length distributions, LVF minimizes both the expected flowtime and the expected makespan.

AB - We consider a situation in which n jobs, requiring random amounts of processing, all with the same mean, are to be scheduled on m parallel machines with respect to one of two objectives: expected flowtime and expected makespan. We discuss optimality of the rule that says to schedule the jobs with the largest variance first (LVF). We show that for some very simple job length distributions, LVF minimizes both the expected flowtime and the expected makespan.

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

U2 - 10.1287/opre.35.6.884

DO - 10.1287/opre.35.6.884

M3 - Article

AN - SCOPUS:0023455917

SN - 0030-364X

VL - 35

SP - 884

EP - 891

JO - Operations Research

JF - Operations Research

IS - 6

ER -

'LARGEST VARIANCE FIRST' POLICY IN SOME STOCHASTIC SCHEDULING PROBLEMS.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this