✦ LIBER ✦

A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness

✍ Scribed by Schaller, Jeffrey; Valente, Jorge M.S.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling a permutation flow shop with

✍ Schaller, Jeffrey 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 161 KB

A heuristic procedure to minimize number

✍ Gursel A. Suer; Zbigniew Czajkiewicz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 299 KB

A branch and bound algorithm to minimize

✍ A.M.A. Hariri; C.N. Potts 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 66 KB

A multi-objective genetic algorithm for

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

A bicriteria approach to maximize the we

✍ Dvir Shabtay; Yaron Bensoussan; Moshe Kaspi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 199 KB