✦ LIBER ✦

An FPTAS for Uniform Machine Scheduling to Minimize the Total Completion Time and the Total Rejection Penalty

✍ Scribed by Wu, Dan; Luo, Cheng Xin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The single machine serial batch scheduli

✍ Shabtay, Dvir 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Online scheduling on a single machine wi

✍ Ma, Ran; Yuan, Jinjiang 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 240 KB

An optimal online algorithm for single m

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

Two-machine flowshop scheduling with tru

✍ Der-Chiang Li; Peng-Hsiang Hsu; Chin-Chia Wu; T.C.E. Cheng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Unrelated parallel-machine scheduling wi

✍ Wang, Li-Yan; Huang, Xue; Ji, Ping; Feng, En-Min 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 152 KB

A better online algorithm for the parall

✍ Tao, Jiping 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 685 KB