✦ LIBER ✦

A note on “An optimal online algorithm for single machine scheduling to minimize total general completion time”

✍ Scribed by Sheng Yu; Prudence W.H. Wong

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal online algorithm for single m

✍ Ming Liu; Chengbin Chu; Yinfeng Xu; Jiazhen Huo 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 335 KB

An algorithm for single machine sequenci

✍ C.N. Potts; L.N. Van Wassenhove 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 870 KB

An improved branch and bound algorithm f

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

An algorithm for single machine sequenci

✍ A.M.A. Hariri; C.N. Potts 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 721 KB

Competitive Analysis of a Better On-line

✍ Jairo R. Montoya-Torres 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 72 KB

An asymptotically optimal online algorit

✍ Dvir Shabtay; Shlomo Karhi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 227 KB