✦ LIBER ✦

An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times

✍ Scribed by Ji Tian; Ruyan Fu; Jinjiang Yuan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved on-line algorithm for single

✍ Ji Tian; T.C.E. Cheng; C.T. Ng; Jinjiang Yuan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 394 KB

An approximation algorithm for a single-

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

An improved on-line algorithm for schedu

✍ Q.Q. Nong; T.C.E. Cheng; C.T. Ng 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 540 KB

An approximation algorithm for a single-

✍ Eugeniusz Nowicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Analysis of approximation algorithms for

✍ Stanisław Zdrzałka 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 695 KB

The asymptotic performance ratio of an o

✍ Mabel C. Chou; Maurice Queyranne; David Simchi-Levi 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 351 KB