𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristic search algorithms for lot streaming in a two-machine flowshop

✍ Scribed by S. Marimuthu; S.G. Ponnambalam


Publisher
Springer
Year
2005
Tongue
English
Weight
234 KB
Volume
27
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Algorithms to minimize completion time v
✍ 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