✦ LIBER ✦

A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines

✍ Scribed by Eduardo Conde

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solution algorithms for unrelated machin

✍ Siepak, Marcin; Józefczyk, Jerzy 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 827 KB

Unrelated parallel machine scheduling wi

✍ Michael X. Weng; John Lu; Haiying Ren 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Unrelated parallel-machine scheduling wi

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

Note on “Unrelated parallel-machine sche

✍ Yang, Suh-Jenq; Hsu, Chou-Jung; Yang, Dar-Li 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Unrelated parallel-machine scheduling wi

✍ Yang, Suh-Jenq 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 222 KB

A better online algorithm for the parall

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