✦ LIBER ✦

A minimum-cost network flow approach to preemptive parallel-machine scheduling

✍ Scribed by Su, Ling-Huey; Cheng, T.C.E.; Chou, Fuh-Der

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on\({\mathbb {NP}}\)-hardness of

✍ Bellenguez-Morineau, Odile; Chrobak, Marek; Dürr, Christoph; Prot, Damien 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 284 KB

A Coupled Transiently Chaotic Neural Net

✍ Ai-Qing YU; Xing-Sheng GU 📂 Article 📅 2008 🏛 Elsevier ⚖ 714 KB

A combinatorial approach to a class of p

✍ Konstantin Kogan; Eugene Khmelnitsky; Eugene Levner 📂 Article 📅 2002 🏛 Taylor and Francis Group 🌐 English ⚖ 320 KB

Scheduling jobs on parallel machines to

✍ Boris Detienne; Stéphane Dauzère-Pérès; Claude Yugma 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 607 KB

A Pareto evolutionary algorithm approach

✍ Chiuh-Cheng Chyu; Wei-Shung Chang 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 723 KB

A network flow approach to the Minimum C

✍ Wenbo Zhao; Peng Zhang; Tao Jiang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 179 KB