✦ LIBER ✦

A new branch and bound algorithm for minimizing the weighted number of tardy jobs

✍ Scribed by Guochun Tang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Branch and Bound Algorithm to Minimize

✍ Rasti-Barzoki, Morteza; Hejazi, Seyed Reza; Mazdeh, Mohammad Mahdavi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 681 KB

Minimizing weighted number of tardy jobs

✍ Chung-Yee Lee; Surya Liman Danusaputro; Chen-Sin Lin 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 946 KB

Minimizing the weighted number of tardy

✍ Rym M’Hallah; R.L. Bulfin 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 210 KB

A computational study of branch and boun

✍ Marcos Singer; Michael Pinedo 📂 Article 📅 1998 🏛 Taylor and Francis Group 🌐 English ⚖ 253 KB

A Branch and Bound Algorithm to Minimize

✍ Pascal Babu; Laurent Peridy; Eric Pinson 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 123 KB

Minimizing the weighted number of early

✍ H.M. Soroush 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 352 KB