✦ LIBER ✦

Multiple-Machine Lower Bounds for Shop-Scheduling Problems

✍ Scribed by Sourd, Francis; Nuijten, Wim

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for single-machine scheduli

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 588 KB

Lower bounds for the job-shop scheduling

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

A new lower bound for the job-shop sched

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

Lower bounds for on-line single-machine

✍ Leah Epstein; Rob van Stee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Tabu search and lower bound for an indus

✍ D. Prot; O. Bellenguez-Morineau 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Outsourcing and scheduling for two-machi

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