๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Scheduling stochastic jobs on a single machine subject to breakdowns

โœ Scribed by K. D. Glazebrook

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
745 KB
Volume
31
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling jobs with random processing t
Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
โœ X. Cai; F. S. Tu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 942 KB

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time ofeach job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objec

A note on scheduling parallel machines s
A note on scheduling parallel machines subject to breakdown and repair
โœ Joseph Y.-T. Leung; Michael Pinedo ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 127 KB

## Abstract In this paper we consider __n__ jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time __t__ equal to __m__(__t__). Preemptions are allowed. We consider three objectives, namely, t

Scheduling maintenance and semiresumable
Scheduling maintenance and semiresumable jobs on a single machine
โœ Gregory H. Graves; Chung-Yee Lee ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 349 KB ๐Ÿ‘ 1 views

The majority of scheduling literature assumes that the machines are available at all times. In this paper, we study single machine scheduling problems where the machine maintenance must be performed within certain intervals and hence the machine is not available during the maintenance periods. We al