✦ LIBER ✦

The permutation flow shop with buffers: A tabu search approach

✍ Scribed by Eugeniusz Nowicki

Book ID: 108445410
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 360 KB
Volume: 116
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(98)00017-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The permutation flow shop problem with b

The permutation flow shop problem with blocking. A tabu search approach

✍ Józef Grabowski; Jarosław Pempera 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 290 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

A two-machine permutation flow shop sche

A two-machine permutation flow shop scheduling problem with buffers

✍ Czesław Smutnicki 📂 Article 📅 1998 🏛 Springer 🌐 German ⚖ 761 KB

A tabu search algorithm based on new blo

A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage

✍ Shaohua Li; Lixin Tang 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 204 KB

A chaotic harmony search algorithm for t

A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers

✍ Quan-Ke Pan; Ling Wang; Liang Gao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 657 KB

A hybrid harmony search algorithm for th

A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem

✍ Ling Wang; Quan-Ke Pan; M. Fatih Tasgetiren 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 547 KB