𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem

✍ Scribed by Peter Greistorfer; Hans Kellerer


Book ID
110300216
Publisher
Springer US
Year
2001
Tongue
English
Weight
217 KB
Volume
7
Category
Article
ISSN
1381-1231

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