✦ LIBER ✦

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

✍ Scribed by Queyranne, Maurice; Schulz, Andreas S.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Inte

✍ Bixby, Robert E.; Boyd, E. Andrew; Ríos-Mercado, Roger Z. 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 211 KB

Approximation Algorithms for Precedence-

✍ Fabián A Chudak; David B Shmoys 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Computational experience with a backtrac

✍ James H. Patterson; F. Brian Talbot; Roman Slowinski; Jan Wegłarz 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 895 KB

Solution approaches for a real-life reso

✍ Emrah B. Edis; Irem Ozkarahan 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 272 KB

An approximate algorithm for a high-mult

✍ Carlo Filippi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Improved Bounds on Relaxations of a Para

✍ Cynthia A. Phillips; Andreas S. Schulz; David B. Shmoys; Cliff Stein; Joel Wein 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 131 KB