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

Minimizing flow-time variance in a single-machine system using genetic algorithms

โœ Scribed by Imran Ali Chaudhry; Paul R. Drake

Publisher
Springer
Year
2007
Tongue
English
Weight
237 KB
Volume
39
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms to minimize completion time v
Algorithms to minimize completion time variance in a two machine flowshop
โœ Charalambos A. Marangos; Vinay Govande; G. Srinivasan; Emory W. Zimmers Jr. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 252 KB

This paper presents algorithms to minimize the variance of completion time (CTV) when n jobs have to be processed on two machines. All the jobs visit the machines in the same order or technological sequence. These algorithms are applicable in manufacturing systems where both the facilities could be

Minimizing weighted mean absolute deviat
Minimizing weighted mean absolute deviation of flow times in single machine systems
โœ Y. P. Aneja; S. N. Kabadi; A. Nagar ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 94 KB ๐Ÿ‘ 2 views

We discuss the problem of scheduling several jobs on a single machine with the objective of minimizing the weighted mean absolute deviation of flow times around the weighted mean flow time. We first show that the optimal schedule is W-shaped. For the unweighted case, we show that all optimal schedul