✦ LIBER ✦

A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

✍ Scribed by Peihai Liu; Xiwen Lu; Yang Fang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line algorithms for minimizing makesp

✍ Gouchuan Zhang; Xiaoqiang Cai; C.K. Wong 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

A GRASP approach for makespan minimizati

✍ Purushothaman Damodaran; Mario C. Vélez-Gallego; Jairo Maya 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 724 KB

A particle swarm optimization algorithm

✍ Purushothaman Damodaran; Don Asanka Diyadawagamage; Omar Ghrayeb; Mario C. Vélez 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 520 KB

A best online algorithm for unbounded pa

✍ Jinjiang Yuan; Ruyan Fu; C. T. Ng; T. C. E. Cheng 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 433 KB

On-line scheduling on a batch machine to

✍ Ruyan Fu; Ji Tian; Jinjiang Yuan; Cheng He 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Heuristics for makespan minimization on

✍ Purushothaman Damodaran; Mario C. Velez-Gallego 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 537 KB