✦ LIBER ✦

Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint

✍ Scribed by Joachim Breit

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved heuristic for two-machine fl

✍ T.C.Edwin Cheng; Guoqing Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 220 KB

A polynomial-time approximation scheme f

✍ Joachim Breit 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 202 KB

An improved heuristic for two-machine fl

✍ Hatem Hadda; Najoua Dridi; Sonia Hajri-Gabouj 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 258 KB

An approximation scheme for two-machine

✍ Xiuli Wang; T.C. Edwin Cheng 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 177 KB

An improved algorithm for the two machin

✍ Hatem Hadda 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 256 KB

An approximation algorithm for a single-

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 679 KB