✦ LIBER ✦

One machine sequencing to minimize mean flow time with minimum number tardy

✍ Scribed by Hamilton Emmons

Publisher: John Wiley and Sons
Year: 1975
Tongue: English
Weight: 459 KB
Volume: 22
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800220314

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-machine flow shop scheduling with co

Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

✍ Wing-Kwan Yeung; Ceyda Oğuz; Tai-Chiu Edwin Cheng 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

Scheduling on M parallel machines subjec

Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time

✍ Ali Allahverdi; John Mittenthal 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB 👁 1 views

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 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