✦ LIBER ✦

Makespan minimization in preemptive two machine job shops

✍ Scribed by S. V. Sevastianov; G. J. Woeginger

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the makespan in the non-preem

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

Scheduling Three-Operation Jobs in a Two

✍ Jatinder N.D. Gupta; Christos P. Koulamas; George J. Kyparisis; Chris N. Potts; 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 135 KB

Stochastically minimizing the makespan i

✍ Jerzy Kamburowski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Tighter Bounds on Preemptive Job Shop Sc

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

Flow shop scheduling with deteriorating

✍ Ji-Bo Wang 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 233 KB

On-line and off-line preemptive two-mach

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