✦ LIBER ✦

New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

✍ Scribed by Michael Andresen, Tanka Nath Dhamala

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the total tardiness and makes

✍ Samaneh Noori-Darvish, Reza Tavakkoli-Moghaddam 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 312 KB

A multi-objective genetic algorithm for

✍ T. Pasupathy; Chandrasekharan Rajendran; R.K. Suresh 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 270 KB

MIP models and hybrid algorithm for mini

✍ Mi-Yi Kim; Young Hoon Lee 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 839 KB

Minimizing the Makespan in a Single-Mach

✍ W-H Kuo and D-L Yang 📂 Article 📅 2008 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 785 KB

The application of genetic algorithms to

✍ Chan, Felix T.S.; Wong, T.C.; Chan, L.Y. 📂 Article 📅 2009 🏛 Taylor and Francis Group 🌐 English ⚖ 228 KB

Different initial sequences for the heur

✍ Framinan, J. M.; Leisten, R.; Rajendran, C. 📂 Article 📅 2003 🏛 Taylor and Francis Group 🌐 English ⚖ 280 KB