A note on stochastic scheduling on a single machine subject to breakdown-the preemptive repeat model

Esther Frostig

doi:10.1017/S0269964800002138

A note on stochastic scheduling on a single machine subject to breakdown-the preemptive repeat model

Esther Frostig

Department of Statistics

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

Abstract

This paper considers scheduling n jobs on one machine to minimize the expected weighted flowtime and the number of late jobs. The processing times of the jobs are independent random variables. The machine is subject to failure and repair where the uptimes are exponentially distributed. We find the optimal policies for the preemptive repeat model.

Original language	English
Pages (from-to)	349-354
Number of pages	6
Journal	Probability in the Engineering and Informational Sciences
Volume	5
Issue number	3
DOIs	https://doi.org/10.1017/S0269964800002138
State	Published - 1991

ASJC Scopus subject areas

Statistics and Probability
Statistics, Probability and Uncertainty
Management Science and Operations Research
Industrial and Manufacturing Engineering

Access to Document

10.1017/S0269964800002138

Cite this

@article{9c12f0930bfa429e9f8d7c28cf24a84c,

title = "A note on stochastic scheduling on a single machine subject to breakdown-the preemptive repeat model",

abstract = "This paper considers scheduling n jobs on one machine to minimize the expected weighted flowtime and the number of late jobs. The processing times of the jobs are independent random variables. The machine is subject to failure and repair where the uptimes are exponentially distributed. We find the optimal policies for the preemptive repeat model.",

author = "Esther Frostig",

year = "1991",

doi = "10.1017/S0269964800002138",

language = "English",

volume = "5",

pages = "349--354",

journal = "Probability in the Engineering and Informational Sciences",

issn = "0269-9648",

publisher = "Cambridge University Press",

number = "3",

}

TY - JOUR

T1 - A note on stochastic scheduling on a single machine subject to breakdown-the preemptive repeat model

AU - Frostig, Esther

PY - 1991

Y1 - 1991

N2 - This paper considers scheduling n jobs on one machine to minimize the expected weighted flowtime and the number of late jobs. The processing times of the jobs are independent random variables. The machine is subject to failure and repair where the uptimes are exponentially distributed. We find the optimal policies for the preemptive repeat model.

AB - This paper considers scheduling n jobs on one machine to minimize the expected weighted flowtime and the number of late jobs. The processing times of the jobs are independent random variables. The machine is subject to failure and repair where the uptimes are exponentially distributed. We find the optimal policies for the preemptive repeat model.

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

U2 - 10.1017/S0269964800002138

DO - 10.1017/S0269964800002138

M3 - Article

AN - SCOPUS:84974201117

SN - 0269-9648

VL - 5

SP - 349

EP - 354

JO - Probability in the Engineering and Informational Sciences

JF - Probability in the Engineering and Informational Sciences

IS - 3

ER -

A note on stochastic scheduling on a single machine subject to breakdown-the preemptive repeat model

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this