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

Single machine scheduling with coefficient of variation minimization

โœ Scribed by M. Raghavachari; M. Zammouri

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
434 KB
Volume
62
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling to minimize the coefficient o
Scheduling to minimize the coefficient of variation
โœ Prabuddha De; Jay B. Ghosh; Charles E. Wells ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 386 KB

In this paper, we address the problem of uninterruptedly scheduling a set of independent jobs that are ready at time zero with the objective of minimizing the coefficient of variation (CV) of their completion times. We first show that, for high processing time values of the longest job, a variance (

Single machine scheduling with batch del
Single machine scheduling with batch deliveries
โœ T.C.Edwin Cheng; Valery S. Gordon; Mikhail Y. Kovalyov ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 584 KB
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