✦ LIBER ✦

An linear programming based lower bound for the simple assembly line balancing problem

✍ Scribed by Marc Peeters; Zeger Degraeve

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Branch-and-bound algorithms for simple a

✍ S. B. Liu; K. M. Ng; H. L. Ong 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 179 KB

Rule-based modeling and constraint progr

✍ Seyda Topaloglu; Latif Salum; Aliye Ayca Supciller 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 345 KB

AP-invariant-based algorithm for simple

✍ Ozcan Kilincci; G. Mirac Bayhan 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 197 KB

Lower bounds based on linear programming

✍ Zvi Drezner 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 268 KB

Simple heuristics for the assembly line

✍ Mayron César O. Moreira; Marcus Ritt; Alysson M. Costa; Antonio A. Chaves 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 594 KB

Branch-and-bound algorithms for the mult

✍ Ilana Berger; Jean-Marie Bourjolly; Gilbert Laporte 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 513 KB