✦ LIBER ✦

A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop

✍ Scribed by A.M.A. Hariri; C.N. Potts

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Using Lagrangean relaxation to minimize

✍ Stéphane Dauzère-Pérès; Marc Sevaux 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Improved lower bounds for minimizing the

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 257 KB