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

A tabu search approach for group scheduling in buffer-constrained flow shop cells

โœ Scribed by Solimanpur, Maghsud; Elmi, Atabak


Book ID
125845648
Publisher
Taylor and Francis Group
Year
2011
Tongue
English
Weight
452 KB
Volume
24
Category
Article
ISSN
0951-192X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A tabu search approach for the flow shop
โœ M. Ben-Daya; M. Al-Fawzan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 788 KB

In this paper, we propose a tabu search approach for solving the permutation flow shop scheduling problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighborhoods of a given sequence and a combined scheme for intensification and diversification