✦ LIBER ✦

The single-machine absolute-deviation early-tardy problem with random completion times

✍ Scribed by Umar M. Al-Turki; John Mittenthal; M. Raghavachari

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 762 KB
Volume: 43
Category: Article
ISSN: 0894-069X
DOI: 10.1002/(sici)1520-6750(199606)43:4<573::aid-nav9>3.0.co;2-4

No coin nor oath required. For personal study only.

✦ Synopsis

We consider sequencing n jobs on a single machine subject to job completion times arising from either machine breakdowns or other causes. The objective is to minimize an expected weighted combination of due dates, completion times, earliness, and tardiness penalties. The determination of optimal distinct due dates or optimal common due dates for a given schedule is investigated. The scheduling problem for a fixed common due date is considered when random completion times arise from machine breakdowns. The optimality of a V- shaped about (a point) Tsequence is established when the number of machine breakdowns follows either a Poisson or a geometric distribution and the duration of a breakdown has an exponential distribution.

📜 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 the single-machine scheduling

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

✍ Suresh Chand; Hans Schneeberger 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th

Minimizing absolute and squared deviatio

Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date

✍ Uttarayan Bagchi; Yih-Long Chang; Robert S. Sullivan 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB