✦ LIBER ✦

Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan

✍ Scribed by Zhao, Kejun; Lu, Xiwen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation schemes for two-agent sche

✍ Zhao, Kejun; Lu, Xiwen 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Online scheduling on two uniform machine

✍ Ming Liu; Yinfeng Xu; Chengbin Chu; Feifeng Zheng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 650 KB

Makespan minimization for two parallel m

✍ Dehua Xu; Zhenmin Cheng; Yunqiang Yin; Hongxing Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Scheduling jobs with release dates and t

✍ Giuseppe Lancia 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 168 KB

A best possible on-line algorithm for tw

✍ Liu, Peihai; Lu, Xiwen 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Flexible preventive maintenance planning

✍ Su, Ling‐Huey; Tsai, Hsiao‐Ling 📂 Article 📅 2010 🏛 Emerald Group Publishing Limited 🌐 English ⚖ 192 KB