✦ LIBER ✦

A note on the proof of the complexity of the little-preemptive open-shop problem

✍ Scribed by Evgeny V. Shchepin; Nodari Vakhania

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the complexity of the concurre

✍ Thomas A. Roemer 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 331 KB

On the Complexity of Non-preemptive Shop

✍ Tamás Kis 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 149 KB

On the complexity of preemptive openshop

✍ C. Sriskandarajah; E. Wagneur 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 731 KB

A note on a problem in the theory of gra

✍ W. Bucher 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 865 KB

A note on the complexity of the problem

✍ C. T. Ng; T. C. E. Cheng; J. J. Yuan 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 267 KB

A note on mathematical aspects of the 3

✍ Wlodzimierz Szwarc 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB