𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On stochastic machine scheduling with general distributional assumptions

✍ Scribed by Wei Li; Kevin D. Glazebrook

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
581 KB
Volume
105
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

A set of stochastic jobs is to be processed on a single machine which is subject to breakdowns and repairs. Under quite general conditions on the job's processing times, the uptimes and the repairtimes of the machine, we find a simple optimal permutation policy for the weighted sum of an increasing function of the completion times. Some optimal policies for two special cases, which have not been investigated in the literature, are given. Moreover, an upper bound is established on the loss incurred when a processing policy is adopted under a simplifying assumption of exponential processing requirements. 9 1998 Elsevier Science B.V.

πŸ“œ SIMILAR VOLUMES

Single-machine scheduling with general l
Single-machine scheduling with general learning functions
✍ Ji-Bo Wang πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 262 KB

Learning effect Sum of completion times square Weighted sum of completion times Maximum lateness Number of tardy jobs a b s t r a c t In this study we consider the single-machine scheduling problem with a sum-ofprocessing-times-based learning effect. The sum-of-processing-times-based learning effec