✦ LIBER ✦

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

✍ Scribed by Rabia Nessah; Imed Kacem

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation schemes for minimizing tot

✍ Zhaohui Liu; T.C. Edwin Cheng 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 159 KB

An improved branch and bound algorithm f

✍ Yunpeng Pan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Single machine scheduling to minimize we

✍ S.P. Bansal 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 592 KB

Genetic algorithm for minimizing the tot

✍ Chin-Chia Wu; Peng-Hsiang Hsu; Juei-Chao Chen; Nae-Sheng Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Algorithms for the single machine total

✍ Fuh-Der Chou; Hui-Mei Wang; Tzu-Yun Chang 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 275 KB

On the single machine serial batching sc

✍ C.T. Ng; T.C.E. Cheng; J.J. Yuan; Z.H. Liu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 175 KB