✦ LIBER ✦

Minimizing makespan on a single machine subject to random breakdowns

✍ Scribed by Nihat Kasap; Haldun Aytug; Anand Paul

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 163 KB
Volume: 34
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.02.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling on a two-machine flowshop sub

Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function

✍ Ali Allahverdi; John Mittenthal 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 716 KB

A note on minimizing the expected makesp

A note on minimizing the expected makespan in flowshops subject to breakdowns

✍ Charles Du; Michael Pinedo 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 509 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 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

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

Minimizing makespan on a single batch pr

Minimizing makespan on a single batch processing machine with nonidentical job sizes

✍ Guochuan Zhang; Xiaoqiang Cai; C.-Y Lee; C.K Wong 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB