✦ LIBER ✦

New bounds and algorithms for the transshipment yard scheduling problem

✍ Scribed by Nils Boysen, Florian Jaehn, Erwin Pesch

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faster Algorithms for the Quickest Trans

✍ Fleischer, Lisa K. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 216 KB

A heuristic algorithm for yard truck sch

✍ Der-Horng Lee; Jin Xin Cao; Qixin Shi; Jiang Hang Chen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 680 KB

Improved Bounds for the Online Schedulin

✍ Rudin, John F.; Chandrasekaran, R. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 171 KB

Two new robust genetic algorithms for th

✍ Rubén Ruiz; Concepción Maroto; Javier Alcaraz 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Two branch-and-bound algorithms for the

✍ Mohammad Ranjbar; Morteza Davari; Roel Leus 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 377 KB

A branch-and-bound algorithm for the res

✍ U. Dorndorf; E. Pesch; T. Phan-Huy 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 184 KB