✦ LIBER ✦

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays

✍ Scribed by Peter Brucker; Sigrid Knust; T.C. Edwin Cheng; Natalia V. Shakhlevich

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-machine flow shop scheduling problem

✍ Jean-Louis Bouquard; Christophe Lenté 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 99 KB

Open-shop scheduling problems with domin

✍ I. Adiri; N. Aizikowitz (Hefetz) 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

A note on the complexity of flow shop sc

✍ Jinjiang Yuan; Ameur Soukhal; Youjun Chen; Lingfa Lu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Complexity and Solutions of Some Three-S

✍ James O. Achugbue and Francis Y. Chin 📂 Article 📅 1982 🏛 INFORMS 🌐 English ⚖ 670 KB

Outsourcing and scheduling for two-machi

✍ Chung, Dae-Young; Choi, Byung-Cheon 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Network flow approaches to pre-emptive o

✍ A. Sedeño-Noda; D. Alcaide; C. González-Martín 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 248 KB