✦ LIBER ✦

An intensive search evolutionary algorithm for single-machine total-weighted-tardiness scheduling problems

✍ Scribed by R. Maheswaran; S.G. Ponnambalam

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An investigation on single machine total

✍ R. Maheswaran; S.G. Ponnambalam 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 268 KB

Fast neighborhood search for the single

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

A branch-and-bound parallel algorithm fo

✍ Mieczysław Wodecki 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 265 KB

A decomposition algorithm for the single

✍ C.N Potts; L.N Van Wassenhove 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 533 KB

An efficient algorithm for the single ma

✍ Suna Kondakci; Ömer Kirca; Meral Azizoǧlu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 553 KB

A decision theory based scheduling proce

✍ V. Sridharan; Z. Zhou 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 834 KB