✦ LIBER ✦

Computing lower and upper bounds for a large-scale industrial job shop scheduling problem

✍ Scribed by Márton Drótos; Gábor Erdős; Tamás Kis

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new lower bound for the job-shop sched

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

Tabu search and lower bound for an indus

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

Mathematical model and genetic optimizat

✍ Z.X. Guo; W.K. Wong; S.Y.S. Leung; J.T. Fan; S.F. Chan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 451 KB

[IEEE 2007 IEEE International Conference

✍ Wang, Bing; Li, Qiaoyun 📂 Article 📅 2007 🏛 IEEE ⚖ 213 KB