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

Multiple machine JIT scheduling: a tabu search approach

โœ Scribed by Finke, Daniel; Medeiros, D. J.; Traband, Mark


Book ID
127221792
Publisher
Taylor and Francis Group
Year
2007
Tongue
English
Weight
225 KB
Volume
45
Category
Article
ISSN
0020-7543

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