✦ LIBER ✦

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications

✍ Scribed by Dominique de Werra; Tamás Kis; Wieslaw Kubiak

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A projective algorithm for preemptive op

✍ Tamás Kis; Dominique de Werra; Wieslaw Kubiak 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 865 KB

Polynomial-time approximation schemes fo

✍ M.A. Kubzin; V.A. Strusevich; J. Breit; G. Schmidt 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

Cost-minimal preemptive scheduling of in

✍ Roman Słowiński 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 729 KB

Polynomial-time approximation scheme for

✍ T.C. Edwin Cheng; Qingqin Nong; Chi To Ng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 1 views