✦ LIBER ✦

A branch and bound procedure to minimize mean absolute lateness on a single processor

✍ Scribed by Timothy D. Fry; Ronald D. Armstrong; Kenneth Darby-Dowman; Patrick R. Philipoom

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single machine scheduling to minimize me

✍ Timothy D. Fry; Ronald D. Armstrong; L. Drew Rosen 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 688 KB

A Branch and Bound Algorithm to Minimize

✍ Pascal Babu; Laurent Peridy; Eric Pinson 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 123 KB

Minimizing maximum absolute lateness and

✍ K. Tanaka; M. Vlach 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 210 KB

A branch and bound algorithm to minimize

✍ A.M.A. Hariri; C.N. Potts 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 66 KB

Single machine scheduling to minimize we

✍ S.P. Bansal 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 592 KB

Branch and Bound Algorithms for Single M

✍ H. A. J. Crauwels; C. N. Potts; D. Van Oudheusden; L. N. Van Wassenhove 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 395 KB