✦ LIBER ✦

Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines

✍ Scribed by E. J. Anderson; T. S. Jayram; T. Kimbrel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line and off-line preemptive two-mach

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

On the Complexity of Non-preemptive Shop

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

Lower bounds for the job-shop scheduling

✍ Bernd Jurisch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 765 KB

Non-preemptive two-machine open shop sch

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

Preemptive Scheduling on Uniform Paralle

✍ Natalia V. Shakhlevich; Vitaly A. Strusevich 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 541 KB

Minimizing the makespan in the non-preem

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