✦ LIBER ✦

Makespan minimization for parallel machines scheduling with multiple availability constraints

✍ Scribed by Hashemian, Navid; Diallo, Claver; Vizvári, Béla

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Makespan minimization for two parallel m

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

Makespan minimization for scheduling unr

✍ Kuo-Ching Ying, Zne-Jung Lee, Shih-Wei Lin 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 231 KB

Optimal algorithms for online scheduling

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

Minimizing Makespan in Semiresumable Cas

✍ Ma Ying; Yang Shan-lin; Chu Cheng-bin 📂 Article 📅 2009 🏛 Elsevier ⚖ 198 KB

Minimizing the makespan in the two-machi

✍ Chung-Yee Lee 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Parallel-machine scheduling with an avai

✍ Chuanli Zhao; Min Ji; Hengyong Tang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 193 KB