Premium
Single‐machine scheduling subject to stochastic breakdowns
Author(s) -
Birge J.,
Frenk J. B. G.,
Mittenthal J.,
Kan A. H. G. Rinnooy
Publication year - 1990
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199010)37:5<661::aid-nav3220370506>3.0.co;2-3
Subject(s) - computer science , mathematical optimization , scheduling (production processes) , minification , single machine scheduling , subject (documents) , job shop scheduling , mathematics , schedule , operating system , library science
We provide several examples of one‐machine problems in which the minimization of expected cost subject to stochastic breakdowns of the machine can be successfully attacked analytically. In particular for the weighted flow‐time model, we derive strong bounds on the difference between the optimal static policy and the WSPT policy and discuss an example in which the WSPT policy is not optimal.