๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A single-machine scheduling problem with random processing times

โœ Scribed by S. Chakravarthy

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
282 KB
Volume
33
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ 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

The single-machine absolute-deviation ea
The single-machine absolute-deviation early-tardy problem with random completion times
โœ Umar M. Al-Turki; John Mittenthal; M. Raghavachari ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 762 KB

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 dis

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