✦ LIBER ✦

A new three-machine shop scheduling: complexity and approximation algorithm

✍ Scribed by Dong, Jianming; Chen, Yong; Zhang, An; Yang, Qifan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Job shop scheduling with a genetic algor

✍ Lee, C.-Y.; Piramuthu, S.; Tsai, Y.-K. 📂 Article 📅 1997 🏛 Taylor and Francis Group 🌐 English ⚖ 272 KB

A new parallel algorithm for the n-Job,

✍ Shusuke Okamoto; Ichie Watanabe; Hajime Iizuka 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 977 KB

A Guide for Genetic Algorithm Based on P

✍ Ak, Bilgesu; Koc, Erdem 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 357 KB

A new encoding scheme-based hybrid algor

✍ Liou, Cheng-Dar; Hsieh, Yi-Chih; Chen, Yin-Yann 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 383 KB

A new complexity proof for the two-stage

✍ Yang, Jaehwan 📂 Article 📅 2009 🏛 Taylor and Francis Group 🌐 English ⚖ 134 KB

A computational study with a new algorit

✍ Jinliang Cheng; George Steiner; Paul Stephenson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 181 KB