✦ LIBER ✦

Fast neighborhood search for the single machine earliness–tardiness scheduling problem

✍ Scribed by Safia Kedad-Sidhoum; Francis Sourd

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast neighborhood search for the single

✍ Özlem Ergun; James B. Orlin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 154 KB

Neighborhood search procedures for singl

✍ Ching-Jong Liao; Hsin-Hui Tsou; Kuo-Ling Huang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 594 KB

Hybrid heuristics for the single machine

✍ Alok Singh, Jorge M. S. Valente, Maria R. A. Moreira 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 270 KB

Greedy randomised dispatching heuristics

✍ Jorge M. S. Valente; Maria R. A. Moreira 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 234 KB

Genetic algorithms for single machine sc

✍ Jorge M. S. Valente; Maria R. A. Moreira; Alok Singh; Rui A. F. S. Alves 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 237 KB

A genetic algorithm approach for the sin

✍ Jorge M.S. Valente; José Fernando Gonçalves 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 258 KB