✦ LIBER ✦

Lower bounds for on-line single-machine scheduling

✍ Scribed by Leah Epstein; Rob van Stee

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for single-machine scheduli

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 588 KB

New lower and upper bounds for on-line s

✍ Bo Chen; André van Vliet; Gerhard J. Woeginger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 507 KB

A lower bound for randomized on-line mul

✍ Jiří Sgall 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Lower bounds for the job-shop scheduling

✍ Bernd Jurisch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 765 KB

Lower bounds for on-line graph coloring

✍ Magnus M. Halldórsson; Mario Szegedy 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 771 KB

Lower bounds for line stabbing

✍ D. Avis; J.M. Robert; R. Wenger 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 721 KB