✦ LIBER ✦

A guided tabu search/path relinking algorithm for the job shop problem

✍ Scribed by Mohammad Mahdi Nasiri; Farhad Kianfar

Publisher: Springer
Year: 2011
Tongue: English
Weight: 515 KB
Volume: 58
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-011-3441-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Advanced Tabu Search Algorithm for th

An Advanced Tabu Search Algorithm for the Job Shop Problem

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 902 KB

A Tabu Search Algorithm for Job Shop Sch

A Tabu Search Algorithm for Job Shop Scheduling

✍ S. G. Ponnambalam; P. Aravindan; S. V. Rajesh 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 108 KB

Tabu-search for the multi-mode job-shop

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

✍ Peter Brucker; Jürgen Neyer 📂 Article 📅 1998 🏛 Springer 🌐 German ⚖ 852 KB

A hybrid tabu search algorithm with an e

A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem

✍ Jun-Qing Li; Quan-Ke Pan; P. N. Suganthan; T. J. Chua 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 747 KB

A new local search algorithm for the job

A new local search algorithm for the job shop scheduling problem

✍ Huang Wen-qi; Yin Ai-hua 📂 Article 📅 2003 🏛 Wuhan University 🌐 English ⚖ 535 KB

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