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

Two-machine flowshop scheduling with truncated learning to minimize the total completion time

โœ Scribed by Der-Chiang Li; Peng-Hsiang Hsu; Chin-Chia Wu; T.C.E. Cheng

Book ID
113536631
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
207 KB
Volume
61
Category
Article
ISSN
0360-8352

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