✦ LIBER ✦

Series A, Sciences || Bounds for the Optimal Scheduling of n Jobs on m Processors

✍ Scribed by W. L. Eastman, S. Even and I. M. Isaacs

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved lower bounds for minimizing the

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Properties of optimal schedules for the

✍ A. A. Lazarev; A. G. Kvaratskhelia 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 202 KB

A note on the optimality of the N- and D

✍ J.R. Artalejo 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 63 KB

Some thoughts on an O(N3)-algorithm for

✍ Norihiro Mizuno 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 316 KB

On a method for the Borel summation of n

✍ L. A. Aizenberg; V. M. Trutnev 📂 Article 📅 1972 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 390 KB

Correction to the Paper on Global Conver

✍ Conn, A. R.; Gould, N. I. M.; Toint, Ph. L. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 337 KB