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

A tabu search approach to the cell formation problem

โœ Scribed by T.-H. Wu; C. Low; W.-T. Wu

Publisher
Springer
Year
2004
Tongue
English
Weight
260 KB
Volume
23
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A tabu search approach for the flow shop
A tabu search approach for the flow shop scheduling problem
โœ 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

A tabu search approach for assigning cel
A tabu search approach for assigning cells to switches in cellular mobile networks
โœ Samuel Pierre; Fabien Houรฉto ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 291 KB

This paper proposes a tabu search approach for assigning cells to switches in wireless cellular networks. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. We ยฎrst establish a new mathematical equivalence between the assignment problem and

A tabu search heuristic for the Steiner
A tabu search heuristic for the Steiner Tree Problem
โœ Gendreau, Michel; Larochelle, Jean-Francois; Sans๏ฟฝ, Brunilde ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 342 KB ๐Ÿ‘ 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se