✦ LIBER ✦

Job Shop Scheduling with the Best-so-far ABC

✍ Scribed by Anan Banharnsakun; Booncharoen Sirinaovakul; Tiranee Achalakul

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pruning by dominance in best-first searc

✍ María R. Sierra; Ramiro Varela 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 320 KB

On the Complexity of Non-preemptive Shop

✍ Tamás Kis 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 149 KB

The complexity of shop-scheduling proble

✍ Yu.N. Sotskov 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 553 KB

New schedule generation schemes for the

✍ Sierra, María R.; Mencía, Carlos; Varela, Ramiro 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 404 KB

Shop‐scheduling problems with fixed and

✍ N.V. Shakhlevich; N. Sotskov; F. Werner 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 363 KB

Stochastic flow-shop scheduling with min

✍ Ali Elyasi… 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 208 KB