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

Single machine scheduling to minimize weighted earliness subject to no tardy jobs

โœ Scribed by Suresh Chand; Hans Schneeberger

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
676 KB
Volume
34
Category
Article
ISSN
0377-2217

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