✦ LIBER ✦

On the Complexity of Non-preemptive Shop Scheduling with Two Jobs

✍ Scribed by Tamás Kis

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tighter Bounds on Preemptive Job Shop Sc

✍ E. J. Anderson; T. S. Jayram; T. Kimbrel 📂 Article 📅 2001 🏛 Springer Vienna 🌐 English ⚖ 96 KB

The complexity of shop-scheduling proble

✍ Yu.N. Sotskov 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 553 KB

On-line and off-line preemptive two-mach

✍ Tracy Kimbrel; Jared Saia 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 82 KB 👁 1 views

Non-preemptive two-machine open shop sch

✍ J. Breit; G. Schmidt; V. A. Strusevich 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 309 KB

Minimizing the makespan in the non-preem

✍ Yazid Mati 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 272 KB

On the complexity of two machine job-sho

✍ Peter Brucker; Svetlana A. Kravchenko; Yuri N. Sotskov 📂 Article 📅 1997 🏛 Springer 🌐 German ⚖ 528 KB