𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using ant colony optimization to solve hybrid flow shop scheduling problems

✍ Scribed by Kemal Alaykýran; Orhan Engin; Alper Döyen

Publisher
Springer
Year
2007
Tongue
English
Weight
208 KB
Volume
35
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counterexamples to optimal permutation s
Counterexamples to optimal permutation schedules for certain flow shop problems
✍ S. S. Panwalkar; M. L. Smith; C. R. Woollam 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract It is well known that a minimal makespan permutation sequence exists for the __n__ × __3__ flow shop problem and for the __n__ × __m__ flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assum