✦ LIBER ✦

Improved Bounds for Acyclic Job Shop Scheduling

✍ Scribed by Uriel Feige; Christian Scheideler

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Permutation-induced acyclic networks for

✍ Tamer F. Abdelmaguid 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Improved genetic algorithm for the job-s

✍ Tung-Kuan Liu; Jinn-Tsong Tsai; Jyh-Horng Chou 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 405 KB

Tighter Bounds on Preemptive Job Shop Sc

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

A new lower bound for the job-shop sched

✍ Peter Brucker; Bernd Jurisch 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 611 KB

Lower bounds for the job-shop scheduling

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

Lower Bounds for Scheduling a Single Rob

✍ Peter Brucker; Sigrid Knust 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 200 KB