𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tabu-search for the multi-mode job-shop problem

✍ Scribed by Peter Brucker; Jürgen Neyer

Publisher
Springer
Year
1998
Tongue
German
Weight
852 KB
Volume
20
Category
Article
ISSN
0171-6468

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Problem difficulty for tabu search in jo
Problem difficulty for tabu search in job-shop scheduling
✍ Jean-Paul Watson; J.Christopher Beck; Adele E. Howe; L.Darrell Whitley 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Tabu search algorithms are among the most effective approaches for solving the job-shop scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so well, and under what conditions. We develop a model of problem difficulty for tabu search in the JSP, borrowing from sim

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