✦ LIBER ✦

Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion

✍ Scribed by Siepak, Marcin; Józefczyk, Jerzy

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 2-approximation algorithm for interval

✍ Adam Kasperski; Paweł Zieliński 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 182 KB

A MIP formulation for the minmax regret

✍ Eduardo Conde 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 186 KB

Discrete harmony search algorithm for th

✍ Kai-zhou Gao; Quan-ke Pan; Jun-qing Li 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 487 KB

An approximation algorithm for the m-mac

✍ Eugeniusz Nowicki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 KB

A Mixed Integer Programming Formulation

✍ Roberto Montemanni 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 176 KB

Algorithms for the single machine total

✍ Fuh-Der Chou; Hui-Mei Wang; Tzu-Yun Chang 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 275 KB