✦ LIBER ✦

A branch and bound method for the job-shop problem with sequence-dependent setup times

✍ Scribed by Christian Artigues; Dominique Feillet

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A flow-shop problem with sequence-depend

✍ Wlodzimierz Szwarc; Jatinder N. D. Gupta 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 388 KB

A high performing metaheuristic for job

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

Schedule Generation Schemes for the Job-

✍ Christian Artigues; Pierre Lopez; Pierre-Dimitri Ayache 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 795 KB

Solving a multi-objective job shop sched

✍ Reza Tavakkoli-Moghaddam; Mozhgan Azarkish; Azar Sadeghnejad-Barkousaraie 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 317 KB

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 hybridization of simulated annealing a

✍ R. Tavakkoli-Moghaddam; M. Khalili; B. Naderi 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 637 KB