✦ LIBER ✦

Minimizing total flow time subject to preemption penalties in online scheduling

✍ Scribed by Mehdi Heydari; Seyed Jafar Sadjadi; Emran Mohammadi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing Total Completion Time Subject

✍ Zhaohui Liu; T.C.Edwin Cheng 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 154 KB

Robust scheduling on a single machine to

✍ Chung-Cheng Lu; Shih-Wei Lin; Kuo-Ching Ying 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Online bounded-batch scheduling to minim

✍ Ma, Ran; Wan, Long; Wei, Lijun; Yuan, Jinjiang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 387 KB

An FPTAS for Uniform Machine Scheduling

✍ Wu, Dan; Luo, Cheng Xin 📂 Article 📅 2013 🏛 Trans Tech Publications Inc. 🌐 English ⚖ 264 KB

Scheduling to minimize energy and flow t

✍ Moseley, Benjamin 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 288 KB

An optimal online algorithm for single m

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