Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

I. Adiri; E. Frostig; A. H.G.Rinnooy Kan

doi:10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I

Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

I. Adiri, E. Frostig, A. H.G.Rinnooy Kan

Department of Statistics

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

Abstract

Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs.

Original language	English
Pages (from-to)	261-271
Number of pages	11
Journal	Naval Research Logistics
Volume	38
Issue number	2
DOIs	https://doi.org/10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I
State	Published - Apr 1991

ASJC Scopus subject areas

Modeling and Simulation
Ocean Engineering
Management Science and Operations Research

Access to Document

10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I

Cite this

@article{546f4a78d6be4ae5b1752a735d244b68,

title = "Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs",

abstract = "Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs.",

author = "I. Adiri and E. Frostig and Kan, {A. H.G.Rinnooy}",

year = "1991",

month = apr,

doi = "10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I",

language = "English",

volume = "38",

pages = "261--271",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley and Sons Inc.",

number = "2",

}

TY - JOUR

T1 - Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

AU - Adiri, I.

AU - Frostig, E.

AU - Kan, A. H.G.Rinnooy

PY - 1991/4

Y1 - 1991/4

N2 - Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs.

AB - Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs.

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

U2 - 10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I

DO - 10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I

M3 - Article

AN - SCOPUS:84989688255

SN - 0894-069X

VL - 38

SP - 261

EP - 271

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 2

ER -

Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this