✦ LIBER ✦

Single machine scheduling using dominance relation to minimize earliness subject to ready and due times

✍ Scribed by Makoto Asano; Hiroshi Ohta

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 770 KB
Volume: 44
Category: Article
ISSN: 0925-5273
DOI: 10.1016/0925-5273(95)00090-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-machine scheduling to minimize ab

Single-machine scheduling to minimize absolute deviation of completion times from a common due date

✍ Wlodzimierz Szwarc 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 518 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