✦ LIBER ✦

Single-machine scheduling of stochastic jobs subject to deterioration or delay

✍ Scribed by K. D. Glazebrook

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 914 KB
Volume: 39
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199208)39:5<613::aid-nav3220390503>3.0.co;2-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling stochastic jobs on a single m

Scheduling stochastic jobs on a single machine subject to breakdowns

✍ K. D. Glazebrook 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 745 KB

Single-machine scheduling subject to sto

Single-machine scheduling subject to stochastic breakdowns

✍ J. Birge; J. B. G. Frenk; J. Mittenthal; A. H. G. Rinnooy Kan 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 767 KB

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

Scheduling on a single machine with a si

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 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB 👁 2 views

Scheduling of a single machine to minimi

Scheduling of a single machine to minimize total weighted completion time subject to release dates

✍ Lucio Bianco; Salvatore Ricciardelli 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 764 KB

## Abstract In this paper the __n__/1/__r__~j~ Σ~j~ __w__~__j__~ __C__~__j__~ problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are

Single-Machine Scheduling to Minimize a

Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

✍ J.A. Hoogeveen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 210 KB

We consider the problem of scheduling n jobs on a single machine that is continuously available from time zero onward and that can handle no more than one job at a time. Each job requires processing during a given positive uninter-Ž . rupted time. The cost of each job is measured by K Ks2, 3 nondecr