✦ LIBER ✦

Worst-case analysis of Dannenbring's 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 a scheduling algo

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

Sevast'yanov's algorithm for the flow-sh

✍ Helena Ramalhinho Lourenço 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 825 KB

A note on worst-case analysis of approxi

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

Worst-case analysis of heuristics for op

✍ Bo Chen; Vitaly A. Strusevich 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 623 KB

A worst-case analysis of two approximate

✍ Giovanni Righini; Marco Trubian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Worst-case analysis of greedy algorithms

✍ Tsung-Chyan Lai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 360 KB