✦ LIBER ✦

Worst-case analysis of an approximation algorithm for flow-shop scheduling

✍ Scribed by Eugeniusz Nowicki; Czesław Smutnicki

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case analysis of Dannenbring's alg

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 420 KB

Worst-case analysis of a scheduling algo

✍ Jeremy Spinrad 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 150 KB

A linear time approximation algorithm fo

✍ Marcus Poggi; David Sotelo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 249 KB

A note on worst-case analysis of approxi

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 370 KB

An Effective PSO-Based Memetic Algorithm

✍ Bo Liu; Ling Wang; Yi-Hui Jin 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 377 KB

An approximation algorithm for the m-mac

✍ Eugeniusz Nowicki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 KB