✦ LIBER ✦

Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

✍ Scribed by Miguel A. González, Camino R. Vela…

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search heuristic for the multipro

✍ Paulo M. França; Michel Gendreau; Gilbert Laporte; Felipe M. Müller 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 961 KB

A high performing metaheuristic for job

✍ B. Naderi; S.M.T. Fatemi Ghomi; M. Aminnayeri 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 451 KB

Scheduling sequence-dependent setup time

✍ B. Naderi; M. Zandieh; S. M. T. Fatemi Ghomi 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 412 KB

Using Genetic Algorithms and Heuristics

✍ Waiman Cheung; Hong Zhou 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 131 KB

Simulation-based metamodels for scheduli

✍ Vinod, V.; Sridharan, R. 📂 Article 📅 2008 🏛 Taylor and Francis Group 🌐 English ⚖ 209 KB

Dynamic job-shop scheduling with sequenc

✍ V. Vinod; R. Sridharan 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 349 KB