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

Completion time variance minimization on a single machine is difficult

โœ Scribed by Wieslaw Kubiak

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
448 KB
Volume
14
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimization of expected variance of com
Minimization of expected variance of completion times on single machine for stochastic jobs
โœ V. Rajendra Prasad; D. K. Manna ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 461 KB ๐Ÿ‘ 2 views

This article deals with the problem of scheduling jobs with random processing times on single machine in order to minimize the expected variance of job completion times. SutTicient conditions for the existence of V-shaped optimal sequences are derived separately for general and ordered job processin

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